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-EXP.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:24:17,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:24:17,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:24:17,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:24:17,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:24:17,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:24:17,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:24:17,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:24:17,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:24:17,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:24:17,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:24:17,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:24:17,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:24:17,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:24:17,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:24:17,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:24:17,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:24:17,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:24:17,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:24:17,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:24:17,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:24:17,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:24:17,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:24:17,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:24:17,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:24:17,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:24:17,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:24:17,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:24:17,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:24:17,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:24:17,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:24:17,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:24:17,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:24:17,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:24:17,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:24:17,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:24:17,235 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:24:17,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:24:17,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:24:17,263 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:24:17,263 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:24:17,263 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:24:17,264 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:24:17,264 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:24:17,264 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:24:17,264 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:24:17,264 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:24:17,264 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:24:17,265 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:24:17,265 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:24:17,265 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:24:17,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:24:17,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:24:17,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:24:17,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:24:17,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:24:17,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:24:17,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:24:17,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:24:17,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:24:17,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:24:17,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:24:17,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:24:17,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:24:17,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:24:17,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:24:17,272 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:24:17,272 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:24:17,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:24:17,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:24:17,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:24:17,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:24:17,360 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:24:17,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:24:17,422 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6dce3ed3a/a9867e6ab0804e558c96a30a103faeb3/FLAGa083daf47 [2018-10-24 12:24:17,877 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:24:17,877 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:24:17,883 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6dce3ed3a/a9867e6ab0804e558c96a30a103faeb3/FLAGa083daf47 [2018-10-24 12:24:17,900 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6dce3ed3a/a9867e6ab0804e558c96a30a103faeb3 [2018-10-24 12:24:17,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:24:17,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:24:17,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:17,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:24:17,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:24:17,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:17" (1/1) ... [2018-10-24 12:24:17,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b692d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:17, skipping insertion in model container [2018-10-24 12:24:17,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:17" (1/1) ... [2018-10-24 12:24:17,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:24:17,959 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:24:18,125 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:18,133 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:24:18,165 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:18,199 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:24:18,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18 WrapperNode [2018-10-24 12:24:18,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:18,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:18,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:24:18,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:24:18,211 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:24:18" (1/1) ... [2018-10-24 12:24:18,221 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:24:18" (1/1) ... [2018-10-24 12:24:18,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:18,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:24:18,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:24:18,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:24:18,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (1/1) ... [2018-10-24 12:24:18,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:24:18,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:24:18,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:24:18,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:24:18,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (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:24:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:24:18,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:24:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:24:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:24:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-10-24 12:24:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-10-24 12:24:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:24:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:24:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:24:18,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:24:19,019 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:24:19,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:19 BoogieIcfgContainer [2018-10-24 12:24:19,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:24:19,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:24:19,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:24:19,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:24:19,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:24:17" (1/3) ... [2018-10-24 12:24:19,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c953a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:19, skipping insertion in model container [2018-10-24 12:24:19,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:18" (2/3) ... [2018-10-24 12:24:19,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c953a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:19, skipping insertion in model container [2018-10-24 12:24:19,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:19" (3/3) ... [2018-10-24 12:24:19,032 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:24:19,042 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:24:19,056 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:24:19,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:24:19,105 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:24:19,105 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:24:19,105 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:24:19,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:24:19,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:24:19,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:24:19,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:24:19,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:24:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-24 12:24:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 12:24:19,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:19,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:19,134 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:19,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash -82730588, now seen corresponding path program 1 times [2018-10-24 12:24:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:19,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:19,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:19,324 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:24:19,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:19,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:24:19,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:19,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:24:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:24:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:24:19,354 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-10-24 12:24:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:19,379 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-10-24 12:24:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:24:19,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-24 12:24:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:19,392 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:24:19,392 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 12:24:19,396 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:24:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 12:24:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-24 12:24:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:24:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-24 12:24:19,443 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-10-24 12:24:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:19,444 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-24 12:24:19,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:24:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-24 12:24:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:24:19,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:19,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:19,446 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:19,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -802136646, now seen corresponding path program 1 times [2018-10-24 12:24:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:19,569 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:24:19,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:19,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:24:19,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:19,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:24:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:24:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:19,573 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-24 12:24:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:19,635 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-24 12:24:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:24:19,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 12:24:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:19,637 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:24:19,637 INFO L226 Difference]: Without dead ends: 36 [2018-10-24 12:24:19,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-24 12:24:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-24 12:24:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:24:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-24 12:24:19,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-10-24 12:24:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:19,646 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-24 12:24:19,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:24:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-24 12:24:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:24:19,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:19,648 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, 1, 1, 1] [2018-10-24 12:24:19,648 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:19,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:19,649 INFO L82 PathProgramCache]: Analyzing trace with hash 306624109, now seen corresponding path program 1 times [2018-10-24 12:24:19,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:19,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:19,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:19,725 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-24 12:24:19,727 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:24:19,765 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:19,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:20,129 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:20,134 INFO L272 AbstractInterpreter]: Visited 14 different actions 37 times. Merged at 4 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-24 12:24:20,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:20,178 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:20,352 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 83.87% of their original sizes. [2018-10-24 12:24:20,352 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:20,441 INFO L413 sIntCurrentIteration]: We have 23 unified AI predicates [2018-10-24 12:24:20,441 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:20,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-24 12:24:20,443 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:20,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:20,444 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-10-24 12:24:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:21,054 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-10-24 12:24:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:21,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-24 12:24:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:21,059 INFO L225 Difference]: With dead ends: 57 [2018-10-24 12:24:21,059 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 12:24:21,060 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 12:24:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-10-24 12:24:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:24:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-24 12:24:21,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-10-24 12:24:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:21,081 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-24 12:24:21,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-24 12:24:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:24:21,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:21,083 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:24:21,083 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1567947773, now seen corresponding path program 1 times [2018-10-24 12:24:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:24:21,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:21,285 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-24 12:24:21,286 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:24:21,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:21,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:21,379 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:21,379 INFO L272 AbstractInterpreter]: Visited 17 different actions 46 times. Merged at 4 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-24 12:24:21,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:21,422 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:21,506 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 67.54% of their original sizes. [2018-10-24 12:24:21,506 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:21,818 INFO L413 sIntCurrentIteration]: We have 29 unified AI predicates [2018-10-24 12:24:21,818 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-10-24 12:24:21,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:21,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:21,820 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-10-24 12:24:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:22,882 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-10-24 12:24:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:22,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-24 12:24:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:22,886 INFO L225 Difference]: With dead ends: 69 [2018-10-24 12:24:22,886 INFO L226 Difference]: Without dead ends: 47 [2018-10-24 12:24:22,887 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-24 12:24:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-10-24 12:24:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-24 12:24:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-24 12:24:22,897 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2018-10-24 12:24:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:22,898 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-24 12:24:22,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-24 12:24:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 12:24:22,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:22,900 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:22,900 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:22,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash -78169958, now seen corresponding path program 1 times [2018-10-24 12:24:22,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:22,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:22,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:23,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:23,067 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-24 12:24:23,068 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:24:23,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:23,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:23,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:23,445 INFO L272 AbstractInterpreter]: Visited 31 different actions 217 times. Merged at 19 different actions 126 times. Widened at 2 different actions 12 times. Found 19 fixpoints after 5 different actions. Largest state had 35 variables. [2018-10-24 12:24:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:23,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:23,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,489 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:24:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:23,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:23,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:23,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:23,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:23,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-24 12:24:23,757 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:23,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:24:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:24:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:23,758 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-24 12:24:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:23,858 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-24 12:24:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:24:23,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-24 12:24:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:23,860 INFO L225 Difference]: With dead ends: 71 [2018-10-24 12:24:23,860 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 12:24:23,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 12:24:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-24 12:24:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-24 12:24:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-10-24 12:24:23,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-10-24 12:24:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:23,870 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-10-24 12:24:23,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:24:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-10-24 12:24:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:24:23,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:23,872 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:23,873 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:23,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2019809991, now seen corresponding path program 2 times [2018-10-24 12:24:23,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:23,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:23,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:23,978 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:23,979 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:24:23,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,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 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:24:23,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:23,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:24,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:24:24,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:24,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:24:24,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:24,578 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:24:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:24:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2018-10-24 12:24:25,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:25,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:24:25,244 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-10-24 12:24:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:25,486 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-10-24 12:24:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:24:25,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-10-24 12:24:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:25,488 INFO L225 Difference]: With dead ends: 88 [2018-10-24 12:24:25,488 INFO L226 Difference]: Without dead ends: 60 [2018-10-24 12:24:25,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:24:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-24 12:24:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-10-24 12:24:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-24 12:24:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-10-24 12:24:25,500 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2018-10-24 12:24:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:25,500 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-24 12:24:25,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-10-24 12:24:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 12:24:25,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:25,502 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:25,502 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:25,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash 320896336, now seen corresponding path program 3 times [2018-10-24 12:24:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:25,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:25,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:25,651 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:24:25,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,652 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:24:25,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:25,663 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:25,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:25,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:25,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:25,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:25,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-10-24 12:24:25,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:25,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:24:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:24:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:25,907 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-10-24 12:24:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:26,017 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2018-10-24 12:24:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:26,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-24 12:24:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:26,019 INFO L225 Difference]: With dead ends: 93 [2018-10-24 12:24:26,019 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 12:24:26,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 12:24:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-24 12:24:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 12:24:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-10-24 12:24:26,029 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 46 [2018-10-24 12:24:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:26,030 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-10-24 12:24:26,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:24:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-10-24 12:24:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 12:24:26,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:26,032 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:26,032 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:26,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 894583805, now seen corresponding path program 4 times [2018-10-24 12:24:26,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,469 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:26,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:26,470 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:24:26,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,470 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:24:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:26,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:26,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-10-24 12:24:26,919 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:26,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:26,923 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 7 states. [2018-10-24 12:24:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:27,078 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-10-24 12:24:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:27,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-24 12:24:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:27,081 INFO L225 Difference]: With dead ends: 115 [2018-10-24 12:24:27,081 INFO L226 Difference]: Without dead ends: 79 [2018-10-24 12:24:27,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-24 12:24:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-10-24 12:24:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:24:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-10-24 12:24:27,095 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 49 [2018-10-24 12:24:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:27,095 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-24 12:24:27,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-10-24 12:24:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:24:27,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:27,097 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:27,098 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1943102000, now seen corresponding path program 5 times [2018-10-24 12:24:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:27,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:24:27,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:27,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:27,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:24:27,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,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 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:24:27,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:27,281 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:27,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:27,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:27,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:24:27,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:24:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2018-10-24 12:24:27,622 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:27,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:24:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:24:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:24:27,623 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-10-24 12:24:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:27,955 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2018-10-24 12:24:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:24:27,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-24 12:24:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:27,958 INFO L225 Difference]: With dead ends: 101 [2018-10-24 12:24:27,958 INFO L226 Difference]: Without dead ends: 75 [2018-10-24 12:24:27,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:24:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-24 12:24:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-10-24 12:24:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-24 12:24:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-10-24 12:24:27,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 52 [2018-10-24 12:24:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:27,969 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-10-24 12:24:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:24:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-10-24 12:24:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:24:27,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:27,971 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:27,971 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:27,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash 212252830, now seen corresponding path program 6 times [2018-10-24 12:24:27,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 12:24:28,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:28,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:28,215 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:24:28,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,215 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:24:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:28,222 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:28,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:28,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:28,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:24:28,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:24:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:28,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 7 [2018-10-24 12:24:28,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:28,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:28,465 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 7 states. [2018-10-24 12:24:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:28,571 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-10-24 12:24:28,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:28,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-10-24 12:24:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:28,578 INFO L225 Difference]: With dead ends: 95 [2018-10-24 12:24:28,578 INFO L226 Difference]: Without dead ends: 81 [2018-10-24 12:24:28,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:24:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-24 12:24:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-24 12:24:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-24 12:24:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-10-24 12:24:28,590 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 60 [2018-10-24 12:24:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:28,590 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-10-24 12:24:28,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2018-10-24 12:24:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 12:24:28,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:28,592 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:28,592 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:28,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1098046836, now seen corresponding path program 7 times [2018-10-24 12:24:28,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:28,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:28,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 12:24:28,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:28,903 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:28,903 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:24:28,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,903 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:24:28,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:28,912 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:28,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 12:24:29,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 12:24:29,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:29,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2018-10-24 12:24:29,482 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:29,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:24:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:24:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:24:29,483 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 13 states. [2018-10-24 12:24:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:29,750 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2018-10-24 12:24:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:29,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-10-24 12:24:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:29,753 INFO L225 Difference]: With dead ends: 131 [2018-10-24 12:24:29,753 INFO L226 Difference]: Without dead ends: 87 [2018-10-24 12:24:29,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-24 12:24:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-24 12:24:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-24 12:24:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2018-10-24 12:24:29,765 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 66 [2018-10-24 12:24:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:29,766 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2018-10-24 12:24:29,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:24:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2018-10-24 12:24:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-24 12:24:29,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:29,767 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:29,768 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:29,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1838783755, now seen corresponding path program 8 times [2018-10-24 12:24:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:29,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 34 proven. 34 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:24:30,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:30,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:30,518 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:24:30,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,518 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:24:30,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:30,526 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:30,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:24:30,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:30,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:24:30,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:30,992 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 12:24:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:24:31,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:31,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2018-10-24 12:24:31,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:31,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:24:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:24:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:24:31,293 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 14 states. [2018-10-24 12:24:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:31,974 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-10-24 12:24:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 12:24:31,975 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-10-24 12:24:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:31,977 INFO L225 Difference]: With dead ends: 173 [2018-10-24 12:24:31,977 INFO L226 Difference]: Without dead ends: 135 [2018-10-24 12:24:31,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=527, Invalid=1365, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:24:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-24 12:24:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2018-10-24 12:24:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 12:24:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-10-24 12:24:31,991 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 70 [2018-10-24 12:24:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:31,992 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-10-24 12:24:31,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:24:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-10-24 12:24:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 12:24:31,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:31,994 INFO L375 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:31,994 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:31,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1182324676, now seen corresponding path program 9 times [2018-10-24 12:24:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:31,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:31,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-24 12:24:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:24:32,137 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:32,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:32,138 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2018-10-24 12:24:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:32,235 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2018-10-24 12:24:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:32,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-24 12:24:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:32,237 INFO L225 Difference]: With dead ends: 159 [2018-10-24 12:24:32,237 INFO L226 Difference]: Without dead ends: 103 [2018-10-24 12:24:32,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-24 12:24:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-24 12:24:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 12:24:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-10-24 12:24:32,252 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 94 [2018-10-24 12:24:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:32,252 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-10-24 12:24:32,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-10-24 12:24:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 12:24:32,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:32,254 INFO L375 BasicCegarLoop]: trace histogram [13, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:32,254 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:32,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -628161005, now seen corresponding path program 10 times [2018-10-24 12:24:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:32,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:32,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 192 proven. 24 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:24:32,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:32,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:32,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:32,463 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:24:32,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:32,463 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:24:32,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:32,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:32,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-24 12:24:32,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-24 12:24:33,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:33,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2018-10-24 12:24:33,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:33,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:24:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:24:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:24:33,244 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 15 states. [2018-10-24 12:24:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:33,744 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2018-10-24 12:24:33,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:24:33,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2018-10-24 12:24:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:33,746 INFO L225 Difference]: With dead ends: 187 [2018-10-24 12:24:33,746 INFO L226 Difference]: Without dead ends: 115 [2018-10-24 12:24:33,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:24:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-24 12:24:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-10-24 12:24:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-24 12:24:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-10-24 12:24:33,760 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 98 [2018-10-24 12:24:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:33,761 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-10-24 12:24:33,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:24:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-10-24 12:24:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-24 12:24:33,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:33,763 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:33,763 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:33,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash -740258815, now seen corresponding path program 11 times [2018-10-24 12:24:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-24 12:24:34,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:34,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:34,752 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:24:34,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,753 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:24:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:34,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:34,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:24:34,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:34,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:34,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:24:34,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:34,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-24 12:24:34,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-24 12:24:35,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-10-24 12:24:35,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2018-10-24 12:24:35,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-10-24 12:24:35,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-10-24 12:24:35,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,314 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:43 [2018-10-24 12:24:35,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:35,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:24:35,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-24 12:24:35,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:24:35,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:24:35,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-24 12:24:35,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:24:35,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:24:35,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:45 [2018-10-24 12:24:35,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:24:35,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:24:35,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:45 [2018-10-24 12:24:35,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-10-24 12:24:35,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:24:35,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-10-24 12:24:35,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:24:35,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:24:35,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:35,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-24 12:24:36,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-24 12:24:36,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:36,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-10-24 12:24:36,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:36,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:36,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:36,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:7 [2018-10-24 12:24:36,328 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:24:36,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:36,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:1 [2018-10-24 12:24:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-10-24 12:24:36,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:38,286 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-24 12:25:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 33 refuted. 7 times theorem prover too weak. 303 trivial. 0 not checked. [2018-10-24 12:25:01,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:01,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 17] total 41 [2018-10-24 12:25:01,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:01,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:25:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:25:01,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1416, Unknown=9, NotChecked=0, Total=1640 [2018-10-24 12:25:01,551 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 26 states. [2018-10-24 12:25:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:03,091 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-10-24 12:25:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 12:25:03,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-10-24 12:25:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:03,093 INFO L225 Difference]: With dead ends: 201 [2018-10-24 12:25:03,093 INFO L226 Difference]: Without dead ends: 120 [2018-10-24 12:25:03,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 188 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=524, Invalid=3007, Unknown=9, NotChecked=0, Total=3540 [2018-10-24 12:25:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-24 12:25:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-24 12:25:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-24 12:25:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-10-24 12:25:03,111 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 106 [2018-10-24 12:25:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:03,111 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-10-24 12:25:03,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:25:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-10-24 12:25:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:25:03,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:03,114 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-10-24 12:25:03,114 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:03,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash -885417485, now seen corresponding path program 1 times [2018-10-24 12:25:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:03,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:03,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:04,232 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2018-10-24 12:25:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 194 proven. 32 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-10-24 12:25:04,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:04,547 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:04,547 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-10-24 12:25:04,548 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [28], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [68], [70], [76], [79], [81], [84], [86], [87], [88], [89], [91], [92], [93], [94] [2018-10-24 12:25:04,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:25:04,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:25:04,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:25:04,936 INFO L272 AbstractInterpreter]: Visited 37 different actions 275 times. Merged at 21 different actions 140 times. Widened at 3 different actions 12 times. Found 34 fixpoints after 10 different actions. Largest state had 36 variables. [2018-10-24 12:25:04,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:04,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:25:04,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:04,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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:25:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:04,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:25:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:05,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:05,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-10-24 12:25:05,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-10-24 12:25:05,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 91 [2018-10-24 12:25:05,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2018-10-24 12:25:05,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-10-24 12:25:05,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,809 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-24 12:25:05,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:5 [2018-10-24 12:25:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 150 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 12:25:05,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:06,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 125 [2018-10-24 12:25:06,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 181 [2018-10-24 12:25:07,637 WARN L179 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 131 [2018-10-24 12:25:07,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,654 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,677 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,678 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 186 [2018-10-24 12:25:07,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-24 12:25:07,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 125 [2018-10-24 12:25:07,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:07,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,726 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,727 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,728 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,728 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,748 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,749 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,752 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:07,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 190 [2018-10-24 12:25:07,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-24 12:25:08,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,556 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,557 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,558 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,559 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,575 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,577 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 165 [2018-10-24 12:25:08,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-24 12:25:08,638 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,658 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,661 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,667 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,669 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,671 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,694 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,697 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 263 [2018-10-24 12:25:08,775 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:25:08,819 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 18 xjuncts. [2018-10-24 12:25:08,845 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,858 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,884 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:08,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:08,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,059 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,068 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,069 INFO L303 Elim1Store]: Index analysis took 248 ms [2018-10-24 12:25:09,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 136 [2018-10-24 12:25:09,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:09,377 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,381 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:09,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2018-10-24 12:25:09,384 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:09,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:25:09,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:25:09,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:25:09,525 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:139, output treesize:80 [2018-10-24 12:25:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 251 proven. 42 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 12:25:09,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:09,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 46 [2018-10-24 12:25:09,711 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:09,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:25:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:25:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2018-10-24 12:25:09,712 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 33 states. [2018-10-24 12:25:10,697 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 28 [2018-10-24 12:25:11,679 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2018-10-24 12:25:12,458 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2018-10-24 12:25:12,628 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-10-24 12:25:12,855 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 32 [2018-10-24 12:25:13,609 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 32 [2018-10-24 12:25:14,091 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2018-10-24 12:25:15,114 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2018-10-24 12:25:16,004 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 51 [2018-10-24 12:25:16,179 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2018-10-24 12:25:16,776 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-10-24 12:25:17,885 WARN L179 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 33 [2018-10-24 12:25:18,142 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2018-10-24 12:25:18,709 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 41 [2018-10-24 12:25:19,003 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2018-10-24 12:25:19,183 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-10-24 12:25:19,860 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2018-10-24 12:25:20,206 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2018-10-24 12:25:20,626 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2018-10-24 12:25:20,906 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 41 [2018-10-24 12:25:21,137 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2018-10-24 12:25:22,048 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-24 12:25:22,284 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2018-10-24 12:25:22,756 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-10-24 12:25:23,114 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-10-24 12:25:23,417 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2018-10-24 12:25:23,673 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-10-24 12:25:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:23,916 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2018-10-24 12:25:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-24 12:25:23,917 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 115 [2018-10-24 12:25:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:23,921 INFO L225 Difference]: With dead ends: 292 [2018-10-24 12:25:23,922 INFO L226 Difference]: Without dead ends: 230 [2018-10-24 12:25:23,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3917 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1691, Invalid=12115, Unknown=0, NotChecked=0, Total=13806 [2018-10-24 12:25:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-24 12:25:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 178. [2018-10-24 12:25:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-24 12:25:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2018-10-24 12:25:23,949 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 115 [2018-10-24 12:25:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:23,949 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2018-10-24 12:25:23,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:25:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2018-10-24 12:25:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:25:23,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:23,951 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-10-24 12:25:23,952 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:23,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -637270991, now seen corresponding path program 2 times [2018-10-24 12:25:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:23,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:24,412 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 12:25:24,606 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-24 12:25:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 10 proven. 247 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 12:25:26,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:26,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:26,757 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:26,758 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:25:26,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:26,758 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:25:26,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:25:26,770 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:25:27,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-24 12:25:27,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:27,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:25:27,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-10-24 12:25:27,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-24 12:25:27,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-10-24 12:25:27,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-10-24 12:25:27,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2018-10-24 12:25:27,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,781 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,796 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 106 [2018-10-24 12:25:27,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:27,912 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:47, output treesize:46 [2018-10-24 12:25:27,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:27,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:25:27,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-24 12:25:28,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:25:28,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:25:28,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:25:28,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:25:28,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:25:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:25:28,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-10-24 12:25:28,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:25:28,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:28,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:48 [2018-10-24 12:25:28,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:25:28,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:25:28,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:25:29,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:25:29,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:25:29,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:29,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-10-24 12:25:30,585 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 12:25:30,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-24 12:25:30,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:30,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-10-24 12:25:30,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:30,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:30,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:30,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:10 [2018-10-24 12:25:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 77 proven. 107 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-24 12:25:31,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:31,990 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-10-24 12:26:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 68 proven. 173 refuted. 4 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-24 12:26:37,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:37,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 27] total 71 [2018-10-24 12:26:37,222 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:37,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-24 12:26:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-24 12:26:37,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4538, Unknown=30, NotChecked=0, Total=4970 [2018-10-24 12:26:37,224 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand 46 states. [2018-10-24 12:26:38,738 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-10-24 12:26:39,020 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2018-10-24 12:26:39,243 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2018-10-24 12:26:39,651 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 53 [2018-10-24 12:26:39,828 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-10-24 12:26:40,094 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 46 [2018-10-24 12:26:40,532 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 56 [2018-10-24 12:26:40,760 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-10-24 12:26:41,114 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 54 [2018-10-24 12:26:41,334 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2018-10-24 12:26:41,854 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-10-24 12:26:42,209 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2018-10-24 12:26:42,474 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2018-10-24 12:26:42,776 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-10-24 12:26:43,014 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2018-10-24 12:26:43,263 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2018-10-24 12:26:43,562 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-10-24 12:26:43,861 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2018-10-24 12:26:44,168 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-24 12:26:44,387 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2018-10-24 12:26:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:45,168 INFO L93 Difference]: Finished difference Result 358 states and 423 transitions. [2018-10-24 12:26:45,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-24 12:26:45,169 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 115 [2018-10-24 12:26:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:45,172 INFO L225 Difference]: With dead ends: 358 [2018-10-24 12:26:45,172 INFO L226 Difference]: Without dead ends: 214 [2018-10-24 12:26:45,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=1570, Invalid=9956, Unknown=30, NotChecked=0, Total=11556 [2018-10-24 12:26:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-24 12:26:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2018-10-24 12:26:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-24 12:26:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2018-10-24 12:26:45,200 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 115 [2018-10-24 12:26:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:45,200 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2018-10-24 12:26:45,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-24 12:26:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2018-10-24 12:26:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:26:45,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:45,202 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-10-24 12:26:45,202 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:45,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1768520621, now seen corresponding path program 3 times [2018-10-24 12:26:45,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:45,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:45,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:45,477 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 12:26:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 34 proven. 224 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-24 12:26:46,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:46,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:46,496 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:46,497 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:26:46,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:46,497 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:26:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:26:46,506 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:26:46,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:26:46,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:26:46,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:46,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-24 12:26:46,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-24 12:26:46,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:46,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:46,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:46,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2018-10-24 12:26:47,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-10-24 12:26:47,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-10-24 12:26:47,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,265 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 91 [2018-10-24 12:26:47,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,284 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,301 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2018-10-24 12:26:47,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-10-24 12:26:47,551 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:47,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2018-10-24 12:26:47,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 79 [2018-10-24 12:26:47,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,609 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2018-10-24 12:26:47,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-24 12:26:47,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-24 12:26:47,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:5 [2018-10-24 12:26:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 253 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 12:26:47,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 230 proven. 79 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:26:53,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 16] total 62 [2018-10-24 12:26:53,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:53,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-24 12:26:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-24 12:26:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3535, Unknown=2, NotChecked=0, Total=3782 [2018-10-24 12:26:53,841 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 48 states. [2018-10-24 12:26:55,888 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-24 12:27:01,587 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-10-24 12:27:01,820 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-10-24 12:27:02,005 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-24 12:27:02,518 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-24 12:27:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:27:02,853 INFO L93 Difference]: Finished difference Result 560 states and 662 transitions. [2018-10-24 12:27:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-24 12:27:02,853 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 115 [2018-10-24 12:27:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:27:02,856 INFO L225 Difference]: With dead ends: 560 [2018-10-24 12:27:02,856 INFO L226 Difference]: Without dead ends: 293 [2018-10-24 12:27:02,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4297 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1001, Invalid=14249, Unknown=2, NotChecked=0, Total=15252 [2018-10-24 12:27:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-24 12:27:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 219. [2018-10-24 12:27:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-24 12:27:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-10-24 12:27:02,894 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 115 [2018-10-24 12:27:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:27:02,895 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-10-24 12:27:02,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-24 12:27:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-10-24 12:27:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:27:02,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:27:02,896 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-10-24 12:27:02,897 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:27:02,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:27:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464215, now seen corresponding path program 4 times [2018-10-24 12:27:02,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:27:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:02,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:27:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:02,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:27:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:03,583 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-24 12:27:04,098 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-10-24 12:27:06,055 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-10-24 12:27:06,284 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2018-10-24 12:27:06,550 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-24 12:27:06,818 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2018-10-24 12:27:07,163 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2018-10-24 12:27:07,500 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-10-24 12:27:07,789 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-10-24 12:27:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 10 proven. 299 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:27:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:08,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:27:08,055 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:27:08,055 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:27:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:08,055 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:27:08,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:08,063 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:27:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:08,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:27:08,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:27:08,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-24 12:27:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:08,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:27:08,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-24 12:27:08,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 12:27:08,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:27:08,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-24 12:27:08,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-24 12:27:08,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:08,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:27:08,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:14 [2018-10-24 12:27:08,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-24 12:27:08,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-24 12:27:08,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:08,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-10-24 12:27:08,559 WARN L854 $PredicateComparison]: unable to prove that (exists ((SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:27:08,601 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:27:08,653 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-24 12:27:08,708 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:27:08,746 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_20 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_19 Int) (|SelectionSort_write~int_#value| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 v_prenex_17) |c_~#array~0.offset|) v_prenex_18) v_prenex_19 v_prenex_20) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-24 12:27:08,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-10-24 12:27:08,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-24 12:27:08,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 68 [2018-10-24 12:27:08,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 76 [2018-10-24 12:27:08,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 76 [2018-10-24 12:27:08,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 84 [2018-10-24 12:27:08,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 106 [2018-10-24 12:27:08,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 91 [2018-10-24 12:27:09,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 113 [2018-10-24 12:27:09,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 98 [2018-10-24 12:27:09,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 97 [2018-10-24 12:27:09,074 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-24 12:27:09,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 121 [2018-10-24 12:27:09,247 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:09,563 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:27:10,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 128 [2018-10-24 12:27:10,585 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:27:10,585 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:10,907 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:10,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:27:10,939 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-24 12:27:11,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:27:11,432 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:11,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:11,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:27:11,965 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-10-24 12:27:12,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:27:12,496 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-24 12:27:13,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:13,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 161 [2018-10-24 12:27:13,465 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 32 xjuncts. [2018-10-24 12:27:14,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 165 [2018-10-24 12:27:14,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:14,347 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 64 xjuncts. [2018-10-24 12:27:15,514 INFO L267 ElimStorePlain]: Start of recursive call 14: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:27:16,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:16,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 142 [2018-10-24 12:27:16,520 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:16,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 91 treesize of output 144 [2018-10-24 12:27:16,576 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 16 xjuncts. [2018-10-24 12:27:19,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:27:19,050 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:20,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:27:20,347 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:21,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 120 [2018-10-24 12:27:21,708 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:23,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:23,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:23,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 157 [2018-10-24 12:27:23,119 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:24,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:24,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 89 treesize of output 168 [2018-10-24 12:27:24,711 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-24 12:27:24,716 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 32 xjuncts. [2018-10-24 12:27:28,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:27:28,749 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-24 12:27:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:32,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 153 [2018-10-24 12:27:32,472 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 16 xjuncts. [2018-10-24 12:27:36,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:36,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 121 [2018-10-24 12:27:36,637 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-10-24 12:27:38,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 86 treesize of output 189 [2018-10-24 12:27:38,689 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-24 12:27:38,722 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 128 xjuncts. [2018-10-24 12:27:42,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:42,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 91 treesize of output 144 [2018-10-24 12:27:42,752 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 16 xjuncts. [2018-10-24 12:27:44,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:44,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 157 [2018-10-24 12:27:44,967 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 32 xjuncts. [2018-10-24 12:27:47,055 INFO L267 ElimStorePlain]: Start of recursive call 22: 16 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-10-24 12:27:49,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 128 [2018-10-24 12:27:49,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:49,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:27:49,538 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-10-24 12:27:50,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:27:50,042 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-10-24 12:27:50,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:50,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 161 [2018-10-24 12:27:50,785 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 32 xjuncts. [2018-10-24 12:27:51,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 165 [2018-10-24 12:27:51,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:51,829 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 64 xjuncts. [2018-10-24 12:27:53,049 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:53,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:27:53,083 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-10-24 12:27:53,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:27:53,691 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-10-24 12:27:55,279 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:27:57,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 155 [2018-10-24 12:27:57,907 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:57,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:57,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:58,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 156 [2018-10-24 12:27:58,022 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 16 xjuncts. [2018-10-24 12:28:14,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:28:14,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 169 [2018-10-24 12:28:14,212 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-10-24 12:28:24,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:28:24,473 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-10-24 12:28:29,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:29,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 155 [2018-10-24 12:28:29,234 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 16 xjuncts. Received shutdown request... [2018-10-24 12:28:37,682 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:28:37,883 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:28:37,883 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:28:37,889 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:28:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:28:37 BoogieIcfgContainer [2018-10-24 12:28:37,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:28:37,890 INFO L168 Benchmark]: Toolchain (without parser) took 259976.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -136.7 MB). Peak memory consumption was 933.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:37,890 INFO L168 Benchmark]: CDTParser took 0.23 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:28:37,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.79 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:28:37,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.83 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:28:37,891 INFO L168 Benchmark]: Boogie Preprocessor took 31.27 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:28:37,891 INFO L168 Benchmark]: RCFGBuilder took 738.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:37,892 INFO L168 Benchmark]: TraceAbstraction took 258866.85 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 152.0 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 600.6 MB). Peak memory consumption was 940.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:37,894 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.79 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 50.83 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 31.27 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 738.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258866.85 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 152.0 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 600.6 MB). Peak memory consumption was 940.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 442. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. TIMEOUT Result, 258.7s OverallTime, 19 OverallIterations, 15 TraceHistogramMax, 37.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 616 SDtfs, 1544 SDslu, 3720 SDs, 0 SdLazy, 5919 SolverSat, 865 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2407 GetRequests, 1802 SyntacticMatches, 42 SemanticMatches, 563 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12468 ImplicationChecksByTransitivity, 136.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9380914407230198 AbsIntWeakeningRatio, 1.8653846153846154 AbsIntAvgWeakeningVarsNumRemoved, 3.1538461538461537 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 238 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 121.2s InterpolantComputationTime, 2114 NumberOfCodeBlocks, 2024 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3033 ConstructedInterpolants, 78 QuantifiedInterpolants, 3370365 SizeOfPredicates, 187 NumberOfNonLiveVariables, 4307 ConjunctsInSsa, 374 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 5101/7161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown