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/vogal_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:28:17,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:28:17,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:28:17,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:28:17,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:28:17,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:28:17,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:28:17,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:28:17,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:28:17,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:28:17,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:28:17,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:28:17,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:28:17,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:28:17,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:28:17,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:28:17,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:28:17,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:28:17,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:28:17,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:28:17,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:28:17,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:28:17,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:28:17,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:28:17,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:28:17,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:28:17,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:28:17,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:28:17,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:28:17,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:28:17,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:28:17,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:28:17,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:28:17,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:28:17,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:28:17,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:28:17,262 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:28:17,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:28:17,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:28:17,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:28:17,288 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:28:17,288 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:28:17,288 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:28:17,288 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:28:17,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:28:17,289 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:28:17,289 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:28:17,289 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:28:17,289 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:28:17,289 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:28:17,290 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:28:17,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:28:17,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:28:17,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:28:17,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:28:17,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:28:17,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:28:17,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:28:17,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:28:17,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:28:17,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:28:17,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:28:17,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:28:17,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:28:17,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:28:17,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:28:17,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:28:17,293 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:28:17,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:28:17,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:28:17,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:28:17,294 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:28:17,294 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:28:17,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:28:17,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:28:17,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:28:17,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:28:17,380 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:28:17,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-10-24 12:28:17,454 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/168b95099/6a66aed19bd94553b109403a6a5312a3/FLAG294aace72 [2018-10-24 12:28:17,914 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:28:17,915 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-10-24 12:28:17,922 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/168b95099/6a66aed19bd94553b109403a6a5312a3/FLAG294aace72 [2018-10-24 12:28:17,937 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/168b95099/6a66aed19bd94553b109403a6a5312a3 [2018-10-24 12:28:17,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:28:17,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:28:17,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:28:17,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:28:17,954 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:28:17,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:28:17" (1/1) ... [2018-10-24 12:28:17,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc12248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:17, skipping insertion in model container [2018-10-24 12:28:17,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:28:17" (1/1) ... [2018-10-24 12:28:17,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:28:17,992 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:28:18,186 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:28:18,190 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:28:18,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:28:18,239 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:28:18,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18 WrapperNode [2018-10-24 12:28:18,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:28:18,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:28:18,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:28:18,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:28:18,248 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:28:18" (1/1) ... [2018-10-24 12:28:18,256 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:28:18" (1/1) ... [2018-10-24 12:28:18,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:28:18,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:28:18,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:28:18,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:28:18,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (1/1) ... [2018-10-24 12:28:18,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:28:18,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:28:18,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:28:18,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:28:18,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28: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:28:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:28:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:28:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:28:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:28:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:28:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:28:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:28:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:28:19,098 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:28:19,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:28:19 BoogieIcfgContainer [2018-10-24 12:28:19,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:28:19,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:28:19,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:28:19,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:28:19,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:28:17" (1/3) ... [2018-10-24 12:28:19,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faef904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:28:19, skipping insertion in model container [2018-10-24 12:28:19,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:28:18" (2/3) ... [2018-10-24 12:28:19,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faef904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:28:19, skipping insertion in model container [2018-10-24 12:28:19,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:28:19" (3/3) ... [2018-10-24 12:28:19,108 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-10-24 12:28:19,118 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:28:19,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:28:19,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:28:19,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:28:19,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:28:19,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:28:19,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:28:19,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:28:19,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:28:19,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:28:19,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:28:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-10-24 12:28:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:28:19,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:19,199 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:19,201 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:19,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash -450684723, now seen corresponding path program 1 times [2018-10-24 12:28:19,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:19,365 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:28:19,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:28:19,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:28:19,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:19,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:28:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:28:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:28:19,390 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-10-24 12:28:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:19,416 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2018-10-24 12:28:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:28:19,417 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-10-24 12:28:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:19,426 INFO L225 Difference]: With dead ends: 77 [2018-10-24 12:28:19,426 INFO L226 Difference]: Without dead ends: 36 [2018-10-24 12:28:19,430 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:28:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-24 12:28:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-24 12:28:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 12:28:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-24 12:28:19,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2018-10-24 12:28:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:19,468 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-24 12:28:19,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:28:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-10-24 12:28:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:28:19,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:19,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:19,471 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:19,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1427074857, now seen corresponding path program 1 times [2018-10-24 12:28:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:19,587 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:28:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:28:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:28:19,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:19,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:28:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:28:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:28:19,590 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2018-10-24 12:28:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:19,754 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2018-10-24 12:28:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:28:19,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-24 12:28:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:19,759 INFO L225 Difference]: With dead ends: 83 [2018-10-24 12:28:19,760 INFO L226 Difference]: Without dead ends: 56 [2018-10-24 12:28:19,762 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:28:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-24 12:28:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-10-24 12:28:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-24 12:28:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-10-24 12:28:19,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2018-10-24 12:28:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:19,775 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-10-24 12:28:19,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:28:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-10-24 12:28:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 12:28:19,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:19,777 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, 1, 1, 1] [2018-10-24 12:28:19,777 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:19,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 367341036, now seen corresponding path program 1 times [2018-10-24 12:28:19,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:19,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:19,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:19,924 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:28:19,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:19,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:19,925 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-24 12:28:19,927 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [39], [43], [46], [72], [76], [78], [81], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:19,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:19,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:20,458 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:28:20,460 INFO L272 AbstractInterpreter]: Visited 25 different actions 51 times. Merged at 16 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-10-24 12:28:20,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:20,503 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:28:20,624 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 88.1% of their original sizes. [2018-10-24 12:28:20,624 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:28:20,949 INFO L413 sIntCurrentIteration]: We have 26 unified AI predicates [2018-10-24 12:28:20,949 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:28:20,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:28:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-24 12:28:20,950 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:20,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:28:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:28:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:28:20,952 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 10 states. [2018-10-24 12:28:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:23,020 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2018-10-24 12:28:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:28:23,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-10-24 12:28:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:23,029 INFO L225 Difference]: With dead ends: 135 [2018-10-24 12:28:23,029 INFO L226 Difference]: Without dead ends: 108 [2018-10-24 12:28:23,032 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:28:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-24 12:28:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 60. [2018-10-24 12:28:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:28:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-10-24 12:28:23,057 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 27 [2018-10-24 12:28:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:23,058 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-10-24 12:28:23,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:28:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-10-24 12:28:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:28:23,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:23,060 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:23,060 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:23,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash -277715294, now seen corresponding path program 1 times [2018-10-24 12:28:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:23,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:28:23,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:23,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:23,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-24 12:28:23,206 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:23,209 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:23,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:23,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:23,409 INFO L272 AbstractInterpreter]: Visited 33 different actions 115 times. Merged at 23 different actions 59 times. Widened at 3 different actions 5 times. Found 7 fixpoints after 5 different actions. Largest state had 49 variables. [2018-10-24 12:28:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:23,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:23,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:23,453 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:28:23,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:23,467 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:23,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:23,624 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 11 treesize of output 8 [2018-10-24 12:28:23,638 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:28:23,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:23,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:23,647 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:28:23,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:24,062 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 15 treesize of output 11 [2018-10-24 12:28:24,066 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 11 treesize of output 3 [2018-10-24 12:28:24,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,075 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:28:24,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:28:24,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:28:24,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:28:24,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2018-10-24 12:28:24,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:24,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:28:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:28:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:28:24,571 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 7 states. [2018-10-24 12:28:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:25,014 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2018-10-24 12:28:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:28:25,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-10-24 12:28:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:25,015 INFO L225 Difference]: With dead ends: 85 [2018-10-24 12:28:25,015 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 12:28:25,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:28:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 12:28:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-24 12:28:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-24 12:28:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-10-24 12:28:25,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 37 [2018-10-24 12:28:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:25,025 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-10-24 12:28:25,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:28:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-10-24 12:28:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:28:25,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:25,027 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:25,027 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:25,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 70555662, now seen corresponding path program 1 times [2018-10-24 12:28:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:25,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:28:25,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:25,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:25,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-24 12:28:25,172 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:25,175 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:25,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:25,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:25,401 INFO L272 AbstractInterpreter]: Visited 34 different actions 133 times. Merged at 24 different actions 74 times. Widened at 2 different actions 4 times. Found 9 fixpoints after 6 different actions. Largest state had 50 variables. [2018-10-24 12:28:25,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:25,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:25,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:25,441 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:28:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:25,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:25,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:25,696 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 11 treesize of output 8 [2018-10-24 12:28:25,710 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:28:25,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:25,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:25,813 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:28:25,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:26,260 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 16 treesize of output 12 [2018-10-24 12:28:26,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-10-24 12:28:26,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:26,278 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:28:26,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-24 12:28:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:28:26,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:28:26,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:28:26,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2018-10-24 12:28:26,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:26,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:28:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:28:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:28:26,441 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 7 states. [2018-10-24 12:28:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:26,683 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2018-10-24 12:28:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:28:26,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-24 12:28:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:26,685 INFO L225 Difference]: With dead ends: 91 [2018-10-24 12:28:26,686 INFO L226 Difference]: Without dead ends: 86 [2018-10-24 12:28:26,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:28:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-24 12:28:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-10-24 12:28:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:28:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-10-24 12:28:26,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 39 [2018-10-24 12:28:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:26,697 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-10-24 12:28:26,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:28:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-10-24 12:28:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:28:26,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:26,700 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:26,701 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:26,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1835157675, now seen corresponding path program 1 times [2018-10-24 12:28:26,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:26,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:26,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 12:28:26,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:26,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:26,925 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-24 12:28:26,926 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:26,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:26,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:27,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:27,125 INFO L272 AbstractInterpreter]: Visited 34 different actions 127 times. Merged at 24 different actions 68 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-24 12:28:27,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:27,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:27,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:27,163 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) [2018-10-24 12:28:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:27,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:28:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:27,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 12:28:27,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:28:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2018-10-24 12:28:27,383 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:27,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:28:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:28:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:28:27,384 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-10-24 12:28:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:27,474 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2018-10-24 12:28:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:28:27,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-24 12:28:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:27,476 INFO L225 Difference]: With dead ends: 172 [2018-10-24 12:28:27,476 INFO L226 Difference]: Without dead ends: 123 [2018-10-24 12:28:27,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:28:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-24 12:28:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 63. [2018-10-24 12:28:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-24 12:28:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-10-24 12:28:27,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 40 [2018-10-24 12:28:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:27,489 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-10-24 12:28:27,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:28:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-10-24 12:28:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 12:28:27,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:27,491 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:27,491 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1621592682, now seen corresponding path program 2 times [2018-10-24 12:28:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:27,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:27,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 12:28:27,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:27,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:27,613 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:28:27,613 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:28:27,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:27,613 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:28:27,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:28:27,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:28:27,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:28:27,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:28:27,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:28:27,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:28:27,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:27,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-24 12:28:27,848 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:27,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:28:27,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:28:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:28:27,849 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 8 states. [2018-10-24 12:28:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:28,230 INFO L93 Difference]: Finished difference Result 297 states and 379 transitions. [2018-10-24 12:28:28,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:28:28,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-10-24 12:28:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:28,232 INFO L225 Difference]: With dead ends: 297 [2018-10-24 12:28:28,232 INFO L226 Difference]: Without dead ends: 248 [2018-10-24 12:28:28,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:28:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-24 12:28:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 86. [2018-10-24 12:28:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-24 12:28:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-10-24 12:28:28,250 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 43 [2018-10-24 12:28:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:28,251 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-10-24 12:28:28,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:28:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-10-24 12:28:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 12:28:28,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:28,253 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, 1, 1, 1] [2018-10-24 12:28:28,253 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:28,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 646909410, now seen corresponding path program 3 times [2018-10-24 12:28:28,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:28,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:28,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:28:28,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:28,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:28,435 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:28:28,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:28,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:28,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:28:28,435 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:28:28,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:28,436 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:28:28,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:28:28,444 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:28:28,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:28:28,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:28:28,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:28,588 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 11 treesize of output 8 [2018-10-24 12:28:28,590 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:28:28,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:28,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:28,599 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:28:28,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:28,693 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 16 treesize of output 12 [2018-10-24 12:28:28,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-10-24 12:28:28,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:28,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:28,698 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:28:28,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-24 12:28:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:28:28,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 12:28:28,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:28,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 21 [2018-10-24 12:28:28,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:28,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:28:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:28:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:28:28,910 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 15 states. [2018-10-24 12:28:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:30,106 INFO L93 Difference]: Finished difference Result 369 states and 469 transitions. [2018-10-24 12:28:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:28:30,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-10-24 12:28:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:30,109 INFO L225 Difference]: With dead ends: 369 [2018-10-24 12:28:30,109 INFO L226 Difference]: Without dead ends: 300 [2018-10-24 12:28:30,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:28:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-24 12:28:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 106. [2018-10-24 12:28:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 12:28:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-10-24 12:28:30,127 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 49 [2018-10-24 12:28:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2018-10-24 12:28:30,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:28:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2018-10-24 12:28:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-24 12:28:30,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:30,130 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:30,130 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:30,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1692015720, now seen corresponding path program 1 times [2018-10-24 12:28:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:30,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:28:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:30,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 12:28:30,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:30,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:30,255 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-10-24 12:28:30,255 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:30,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:30,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:30,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:30,424 INFO L272 AbstractInterpreter]: Visited 37 different actions 134 times. Merged at 26 different actions 70 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 7 different actions. Largest state had 51 variables. [2018-10-24 12:28:30,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:30,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:30,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:30,454 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:28:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:30,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:30,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 12:28:30,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 12:28:30,599 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:28:30,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 10 [2018-10-24 12:28:30,600 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:30,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:28:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:28:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:28:30,600 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 3 states. [2018-10-24 12:28:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:30,643 INFO L93 Difference]: Finished difference Result 194 states and 243 transitions. [2018-10-24 12:28:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:28:30,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-24 12:28:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:30,645 INFO L225 Difference]: With dead ends: 194 [2018-10-24 12:28:30,645 INFO L226 Difference]: Without dead ends: 135 [2018-10-24 12:28:30,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:28:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-24 12:28:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2018-10-24 12:28:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-24 12:28:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2018-10-24 12:28:30,664 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 54 [2018-10-24 12:28:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:30,665 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2018-10-24 12:28:30,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:28:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2018-10-24 12:28:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-24 12:28:30,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:30,666 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:30,667 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:30,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 510921069, now seen corresponding path program 1 times [2018-10-24 12:28:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:30,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:28:30,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:30,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:30,897 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-24 12:28:30,898 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:30,903 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:30,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:31,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:31,160 INFO L272 AbstractInterpreter]: Visited 41 different actions 208 times. Merged at 31 different actions 119 times. Widened at 6 different actions 15 times. Found 19 fixpoints after 11 different actions. Largest state had 54 variables. [2018-10-24 12:28:31,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:31,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:31,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:31,196 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:28:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:31,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:31,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:31,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-24 12:28:31,654 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 22 treesize of output 15 [2018-10-24 12:28:31,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:31,757 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 15 treesize of output 8 [2018-10-24 12:28:31,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:31,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-10-24 12:28:31,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:31,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:31,782 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:28:31,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-24 12:28:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:28:31,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:31,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-10-24 12:28:32,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-10-24 12:28:32,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-10-24 12:28:32,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-10-24 12:28:32,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:28:32,262 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 15 treesize of output 14 [2018-10-24 12:28:32,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:32,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:28:32,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-24 12:28:32,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:46 [2018-10-24 12:28:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:28:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:32,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2018-10-24 12:28:32,433 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:32,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:28:32,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:28:32,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:28:32,435 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 15 states. [2018-10-24 12:28:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:34,370 INFO L93 Difference]: Finished difference Result 582 states and 723 transitions. [2018-10-24 12:28:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:28:34,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-24 12:28:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:34,374 INFO L225 Difference]: With dead ends: 582 [2018-10-24 12:28:34,374 INFO L226 Difference]: Without dead ends: 482 [2018-10-24 12:28:34,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-10-24 12:28:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-24 12:28:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 159. [2018-10-24 12:28:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-24 12:28:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2018-10-24 12:28:34,408 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 58 [2018-10-24 12:28:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:34,409 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2018-10-24 12:28:34,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:28:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2018-10-24 12:28:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-24 12:28:34,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:34,411 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:34,411 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:34,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash 442881668, now seen corresponding path program 1 times [2018-10-24 12:28:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:34,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:34,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:34,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-24 12:28:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:34,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:34,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-24 12:28:34,597 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:34,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:34,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:34,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:34,886 INFO L272 AbstractInterpreter]: Visited 41 different actions 208 times. Merged at 31 different actions 119 times. Widened at 6 different actions 15 times. Found 19 fixpoints after 11 different actions. Largest state had 55 variables. [2018-10-24 12:28:34,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:34,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:34,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:34,922 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:28:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:34,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:34,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:28:35,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 12:28:35,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:35,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 8] total 17 [2018-10-24 12:28:35,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:35,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:28:35,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:28:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:28:35,716 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand 11 states. [2018-10-24 12:28:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:36,676 INFO L93 Difference]: Finished difference Result 606 states and 771 transitions. [2018-10-24 12:28:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 12:28:36,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-10-24 12:28:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:36,681 INFO L225 Difference]: With dead ends: 606 [2018-10-24 12:28:36,681 INFO L226 Difference]: Without dead ends: 506 [2018-10-24 12:28:36,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:28:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-24 12:28:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 280. [2018-10-24 12:28:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-24 12:28:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2018-10-24 12:28:36,734 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 61 [2018-10-24 12:28:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:36,734 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2018-10-24 12:28:36,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:28:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2018-10-24 12:28:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-24 12:28:36,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:36,736 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:36,736 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:36,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1635858978, now seen corresponding path program 1 times [2018-10-24 12:28:36,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:36,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:36,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:37,754 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2018-10-24 12:28:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 12:28:38,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:38,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:38,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-24 12:28:38,288 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:38,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:38,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:38,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:38,581 INFO L272 AbstractInterpreter]: Visited 42 different actions 260 times. Merged at 32 different actions 152 times. Widened at 5 different actions 14 times. Found 34 fixpoints after 14 different actions. Largest state had 55 variables. [2018-10-24 12:28:38,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:38,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:38,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:38,618 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:28:38,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:38,634 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:38,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:39,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-10-24 12:28:39,037 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 26 treesize of output 19 [2018-10-24 12:28:39,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:39,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-10-24 12:28:39,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:39,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:39,060 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:28:39,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-10-24 12:28:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 12:28:39,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:39,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-10-24 12:28:39,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 65 [2018-10-24 12:28:39,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-10-24 12:28:39,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-24 12:28:39,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:28:39,410 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 15 treesize of output 14 [2018-10-24 12:28:39,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:39,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:28:39,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-24 12:28:39,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:61 [2018-10-24 12:28:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 12:28:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 35 [2018-10-24 12:28:39,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:39,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:28:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:28:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 12:28:39,731 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand 27 states. [2018-10-24 12:28:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:42,051 INFO L93 Difference]: Finished difference Result 713 states and 878 transitions. [2018-10-24 12:28:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:28:42,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-10-24 12:28:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:42,055 INFO L225 Difference]: With dead ends: 713 [2018-10-24 12:28:42,056 INFO L226 Difference]: Without dead ends: 599 [2018-10-24 12:28:42,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 119 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=602, Invalid=2590, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 12:28:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-24 12:28:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 374. [2018-10-24 12:28:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-24 12:28:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 443 transitions. [2018-10-24 12:28:42,124 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 443 transitions. Word has length 69 [2018-10-24 12:28:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:42,124 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 443 transitions. [2018-10-24 12:28:42,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:28:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 443 transitions. [2018-10-24 12:28:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-24 12:28:42,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:42,126 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:42,126 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:42,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1531070362, now seen corresponding path program 1 times [2018-10-24 12:28:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:42,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:42,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:42,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:28:42,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:42,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:42,629 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-24 12:28:42,629 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [62], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:42,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:42,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:42,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:42,862 INFO L272 AbstractInterpreter]: Visited 42 different actions 222 times. Merged at 32 different actions 126 times. Widened at 6 different actions 16 times. Found 26 fixpoints after 12 different actions. Largest state had 55 variables. [2018-10-24 12:28:42,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:42,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:42,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:42,898 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:28:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:42,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:42,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:43,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-24 12:28:43,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 16 [2018-10-24 12:28:43,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:43,510 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 23 treesize of output 11 [2018-10-24 12:28:43,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:43,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-10-24 12:28:43,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:43,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:43,544 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:28:43,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2018-10-24 12:28:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 12:28:43,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:43,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-10-24 12:28:43,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 71 [2018-10-24 12:28:43,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-10-24 12:28:43,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-24 12:28:43,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:28:43,842 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 15 treesize of output 14 [2018-10-24 12:28:43,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:43,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:28:43,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-24 12:28:43,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:65 [2018-10-24 12:28:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 12:28:44,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:44,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 32 [2018-10-24 12:28:44,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:44,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:28:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:28:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:28:44,171 INFO L87 Difference]: Start difference. First operand 374 states and 443 transitions. Second operand 23 states. [2018-10-24 12:28:45,524 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-24 12:28:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:48,223 INFO L93 Difference]: Finished difference Result 684 states and 833 transitions. [2018-10-24 12:28:48,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-24 12:28:48,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-10-24 12:28:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:48,232 INFO L225 Difference]: With dead ends: 684 [2018-10-24 12:28:48,233 INFO L226 Difference]: Without dead ends: 639 [2018-10-24 12:28:48,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=959, Invalid=4893, Unknown=0, NotChecked=0, Total=5852 [2018-10-24 12:28:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-24 12:28:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 417. [2018-10-24 12:28:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-24 12:28:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 490 transitions. [2018-10-24 12:28:48,314 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 490 transitions. Word has length 69 [2018-10-24 12:28:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:48,315 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 490 transitions. [2018-10-24 12:28:48,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:28:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 490 transitions. [2018-10-24 12:28:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-24 12:28:48,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:48,317 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:48,317 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:48,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1345291482, now seen corresponding path program 1 times [2018-10-24 12:28:48,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:48,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:48,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-24 12:28:49,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:49,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:49,042 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-24 12:28:49,042 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [62], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:49,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:49,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:49,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:49,291 INFO L272 AbstractInterpreter]: Visited 42 different actions 237 times. Merged at 32 different actions 139 times. Widened at 5 different actions 12 times. Found 32 fixpoints after 14 different actions. Largest state had 54 variables. [2018-10-24 12:28:49,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:49,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:49,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:49,328 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:28:49,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:49,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:49,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:49,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-24 12:28:49,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:49,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:28:49,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:49,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-10-24 12:28:49,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:49,848 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:49,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-24 12:28:49,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:49,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:49,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:49,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:31 [2018-10-24 12:28:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:28:49,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:50,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-10-24 12:28:50,439 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-10-24 12:28:50,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 67 [2018-10-24 12:28:50,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-10-24 12:28:50,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-10-24 12:28:50,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:28:50,553 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 15 treesize of output 14 [2018-10-24 12:28:50,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:28:50,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-24 12:28:50,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:57 [2018-10-24 12:28:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 12:28:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:50,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 11] total 32 [2018-10-24 12:28:50,767 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:50,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:28:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:28:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:28:50,768 INFO L87 Difference]: Start difference. First operand 417 states and 490 transitions. Second operand 23 states. [2018-10-24 12:28:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:52,664 INFO L93 Difference]: Finished difference Result 749 states and 904 transitions. [2018-10-24 12:28:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 12:28:52,665 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-10-24 12:28:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:52,668 INFO L225 Difference]: With dead ends: 749 [2018-10-24 12:28:52,668 INFO L226 Difference]: Without dead ends: 688 [2018-10-24 12:28:52,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=631, Invalid=2231, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:28:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-24 12:28:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 417. [2018-10-24 12:28:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-24 12:28:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 484 transitions. [2018-10-24 12:28:52,748 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 484 transitions. Word has length 69 [2018-10-24 12:28:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:52,749 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 484 transitions. [2018-10-24 12:28:52,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:28:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 484 transitions. [2018-10-24 12:28:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-24 12:28:52,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:52,751 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:52,751 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:52,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2087146899, now seen corresponding path program 1 times [2018-10-24 12:28:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:52,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:52,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 12:28:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:52,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:52,957 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-10-24 12:28:52,958 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [62], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:52,959 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:52,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:53,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:53,222 INFO L272 AbstractInterpreter]: Visited 43 different actions 274 times. Merged at 33 different actions 159 times. Widened at 5 different actions 15 times. Found 41 fixpoints after 16 different actions. Largest state had 55 variables. [2018-10-24 12:28:53,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:53,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:53,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:53,259 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) [2018-10-24 12:28:53,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:53,274 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:28:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:53,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 12:28:53,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 12:28:53,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:53,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2018-10-24 12:28:53,427 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:53,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:28:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:28:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:28:53,428 INFO L87 Difference]: Start difference. First operand 417 states and 484 transitions. Second operand 7 states. [2018-10-24 12:28:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:53,723 INFO L93 Difference]: Finished difference Result 827 states and 971 transitions. [2018-10-24 12:28:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:28:53,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-10-24 12:28:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:53,726 INFO L225 Difference]: With dead ends: 827 [2018-10-24 12:28:53,726 INFO L226 Difference]: Without dead ends: 482 [2018-10-24 12:28:53,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:28:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-24 12:28:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 316. [2018-10-24 12:28:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-24 12:28:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 354 transitions. [2018-10-24 12:28:53,793 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 354 transitions. Word has length 73 [2018-10-24 12:28:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:53,793 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 354 transitions. [2018-10-24 12:28:53,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:28:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 354 transitions. [2018-10-24 12:28:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-24 12:28:53,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:53,794 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:53,795 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:53,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1649270340, now seen corresponding path program 1 times [2018-10-24 12:28:53,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:53,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:53,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:54,450 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-24 12:28:54,797 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 12:28:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 12:28:54,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:54,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:54,804 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-10-24 12:28:54,804 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-10-24 12:28:54,805 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:28:54,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:28:55,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:28:55,008 INFO L272 AbstractInterpreter]: Visited 35 different actions 187 times. Merged at 25 different actions 106 times. Widened at 2 different actions 6 times. Found 24 fixpoints after 10 different actions. Largest state had 50 variables. [2018-10-24 12:28:55,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:55,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:28:55,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:55,047 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:28:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:55,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:28:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:55,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 12:28:55,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 12:28:55,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:55,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 18 [2018-10-24 12:28:55,429 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:55,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:28:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:28:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:28:55,430 INFO L87 Difference]: Start difference. First operand 316 states and 354 transitions. Second operand 10 states. [2018-10-24 12:28:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:56,066 INFO L93 Difference]: Finished difference Result 1364 states and 1535 transitions. [2018-10-24 12:28:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:28:56,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-10-24 12:28:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:56,072 INFO L225 Difference]: With dead ends: 1364 [2018-10-24 12:28:56,072 INFO L226 Difference]: Without dead ends: 1276 [2018-10-24 12:28:56,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:28:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-10-24 12:28:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 354. [2018-10-24 12:28:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-24 12:28:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 396 transitions. [2018-10-24 12:28:56,165 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 396 transitions. Word has length 73 [2018-10-24 12:28:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:56,165 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 396 transitions. [2018-10-24 12:28:56,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:28:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 396 transitions. [2018-10-24 12:28:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 12:28:56,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:56,167 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:56,167 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:56,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash 836414820, now seen corresponding path program 2 times [2018-10-24 12:28:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:28:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:56,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 12:28:56,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:56,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:56,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:28:56,494 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:28:56,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:56,494 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:28:56,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:28:56,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:28:56,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:28:56,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:28:56,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:56,629 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 11 treesize of output 8 [2018-10-24 12:28:56,631 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:28:56,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:56,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:56,642 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:28:56,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:56,754 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 17 treesize of output 13 [2018-10-24 12:28:56,757 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:56,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-24 12:28:56,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:56,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:56,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:28:56,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-10-24 12:28:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:28:56,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:28:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:28:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [9] total 22 [2018-10-24 12:28:57,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:28:57,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:28:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:28:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:28:57,178 INFO L87 Difference]: Start difference. First operand 354 states and 396 transitions. Second operand 9 states. [2018-10-24 12:28:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:57,687 INFO L93 Difference]: Finished difference Result 422 states and 468 transitions. [2018-10-24 12:28:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:28:57,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-10-24 12:28:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:57,688 INFO L225 Difference]: With dead ends: 422 [2018-10-24 12:28:57,689 INFO L226 Difference]: Without dead ends: 363 [2018-10-24 12:28:57,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:28:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-24 12:28:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 343. [2018-10-24 12:28:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-24 12:28:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 382 transitions. [2018-10-24 12:28:57,774 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 382 transitions. Word has length 79 [2018-10-24 12:28:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:57,774 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 382 transitions. [2018-10-24 12:28:57,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:28:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 382 transitions. [2018-10-24 12:28:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-24 12:28:57,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:57,776 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:57,776 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:57,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1107939871, now seen corresponding path program 2 times [2018-10-24 12:28:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:57,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:28:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:57,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:28:58,492 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 21 [2018-10-24 12:28:58,917 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-10-24 12:28:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 12:28:58,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:58,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:28:58,936 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:28:58,936 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:28:58,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:28:58,936 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:28:58,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:28:58,944 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:28:59,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:28:59,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:28:59,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:28:59,064 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 11 treesize of output 8 [2018-10-24 12:28:59,067 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:28:59,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:59,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:59,074 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:28:59,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:28:59,204 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 17 treesize of output 13 [2018-10-24 12:28:59,207 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:59,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-24 12:28:59,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:59,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:59,218 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:28:59,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-10-24 12:28:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 12:28:59,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 12:28:59,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:59,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 24 [2018-10-24 12:28:59,433 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:59,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:28:59,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:28:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:28:59,434 INFO L87 Difference]: Start difference. First operand 343 states and 382 transitions. Second operand 16 states. [2018-10-24 12:28:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:28:59,714 INFO L93 Difference]: Finished difference Result 416 states and 459 transitions. [2018-10-24 12:28:59,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:28:59,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-10-24 12:28:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:28:59,716 INFO L225 Difference]: With dead ends: 416 [2018-10-24 12:28:59,716 INFO L226 Difference]: Without dead ends: 311 [2018-10-24 12:28:59,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:28:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-24 12:28:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-24 12:28:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-24 12:28:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 347 transitions. [2018-10-24 12:28:59,800 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 347 transitions. Word has length 83 [2018-10-24 12:28:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:28:59,800 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 347 transitions. [2018-10-24 12:28:59,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:28:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 347 transitions. [2018-10-24 12:28:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-24 12:28:59,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:28:59,802 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:28:59,802 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:28:59,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:28:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1051999796, now seen corresponding path program 3 times [2018-10-24 12:28:59,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:28:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:59,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:28:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:28:59,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:28:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 12:29:00,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:00,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:00,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:00,714 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:29:00,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:00,714 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:00,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:29:00,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:29:00,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:29:00,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:00,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:00,986 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 11 treesize of output 8 [2018-10-24 12:29:00,988 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:29:00,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:00,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:00,995 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:29:00,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:01,142 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 16 treesize of output 12 [2018-10-24 12:29:01,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-10-24 12:29:01,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:01,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:01,146 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:29:01,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-24 12:29:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:29:01,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 12:29:04,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:04,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 30 [2018-10-24 12:29:04,297 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:04,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:29:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:29:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=758, Unknown=1, NotChecked=0, Total=870 [2018-10-24 12:29:04,298 INFO L87 Difference]: Start difference. First operand 311 states and 347 transitions. Second operand 22 states. [2018-10-24 12:29:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:07,318 INFO L93 Difference]: Finished difference Result 2078 states and 2366 transitions. [2018-10-24 12:29:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 12:29:07,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-10-24 12:29:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:07,325 INFO L225 Difference]: With dead ends: 2078 [2018-10-24 12:29:07,325 INFO L226 Difference]: Without dead ends: 1944 [2018-10-24 12:29:07,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=286, Invalid=1605, Unknown=1, NotChecked=0, Total=1892 [2018-10-24 12:29:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2018-10-24 12:29:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 623. [2018-10-24 12:29:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-24 12:29:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 698 transitions. [2018-10-24 12:29:07,529 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 698 transitions. Word has length 92 [2018-10-24 12:29:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:07,530 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 698 transitions. [2018-10-24 12:29:07,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:29:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 698 transitions. [2018-10-24 12:29:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 12:29:07,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:07,532 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:07,532 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 4301570, now seen corresponding path program 4 times [2018-10-24 12:29:07,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:07,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:07,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:07,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:07,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:08,158 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2018-10-24 12:29:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-24 12:29:08,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:08,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:08,716 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:08,716 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:29:08,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:08,716 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:08,727 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:29:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:08,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:08,897 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 11 treesize of output 8 [2018-10-24 12:29:08,904 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:29:08,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:08,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:08,908 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:29:08,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 82 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 12:29:09,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:10,014 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-24 12:29:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 12:29:11,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:11,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 21] total 52 [2018-10-24 12:29:11,044 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:11,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:29:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:29:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2230, Unknown=0, NotChecked=0, Total=2652 [2018-10-24 12:29:11,046 INFO L87 Difference]: Start difference. First operand 623 states and 698 transitions. Second operand 33 states. [2018-10-24 12:29:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:13,875 INFO L93 Difference]: Finished difference Result 1443 states and 1610 transitions. [2018-10-24 12:29:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 12:29:13,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2018-10-24 12:29:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:13,879 INFO L225 Difference]: With dead ends: 1443 [2018-10-24 12:29:13,879 INFO L226 Difference]: Without dead ends: 1152 [2018-10-24 12:29:13,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 161 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=963, Invalid=4889, Unknown=0, NotChecked=0, Total=5852 [2018-10-24 12:29:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2018-10-24 12:29:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 914. [2018-10-24 12:29:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-24 12:29:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1025 transitions. [2018-10-24 12:29:14,129 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1025 transitions. Word has length 99 [2018-10-24 12:29:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:14,130 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1025 transitions. [2018-10-24 12:29:14,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:29:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1025 transitions. [2018-10-24 12:29:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 12:29:14,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:14,133 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:14,133 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:14,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -893091708, now seen corresponding path program 5 times [2018-10-24 12:29:14,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:14,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:14,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:14,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:14,852 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 12:29:15,168 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-10-24 12:29:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 12:29:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:15,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:15,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:15,781 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:29:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:15,781 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:15,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:29:15,790 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:29:15,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:29:15,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:15,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:16,007 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 11 treesize of output 8 [2018-10-24 12:29:16,010 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:29:16,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,024 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:29:16,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-24 12:29:16,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-10-24 12:29:16,269 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 30 treesize of output 23 [2018-10-24 12:29:16,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,285 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:29:16,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-24 12:29:16,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,302 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:29:16,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:29:16,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-24 12:29:16,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:16,330 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:29:16,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:32 [2018-10-24 12:29:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 12:29:16,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 35 proven. 44 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 12:29:16,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 13] total 35 [2018-10-24 12:29:16,730 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:16,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 12:29:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 12:29:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=961, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 12:29:16,731 INFO L87 Difference]: Start difference. First operand 914 states and 1025 transitions. Second operand 24 states. [2018-10-24 12:29:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:18,299 INFO L93 Difference]: Finished difference Result 1637 states and 1817 transitions. [2018-10-24 12:29:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:29:18,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-10-24 12:29:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:18,304 INFO L225 Difference]: With dead ends: 1637 [2018-10-24 12:29:18,304 INFO L226 Difference]: Without dead ends: 1468 [2018-10-24 12:29:18,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 174 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 12:29:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-10-24 12:29:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1064. [2018-10-24 12:29:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-10-24 12:29:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1187 transitions. [2018-10-24 12:29:18,630 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1187 transitions. Word has length 99 [2018-10-24 12:29:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:18,630 INFO L481 AbstractCegarLoop]: Abstraction has 1064 states and 1187 transitions. [2018-10-24 12:29:18,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-24 12:29:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1187 transitions. [2018-10-24 12:29:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 12:29:18,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:18,635 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:18,635 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:18,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 127976646, now seen corresponding path program 6 times [2018-10-24 12:29:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:18,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:18,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 12:29:19,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:19,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:19,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:19,223 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:29:19,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:19,223 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:19,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:29:19,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:29:19,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:29:19,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:19,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 12:29:19,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 12:29:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:20,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 22 [2018-10-24 12:29:20,084 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:20,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:29:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:29:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:29:20,085 INFO L87 Difference]: Start difference. First operand 1064 states and 1187 transitions. Second operand 14 states. [2018-10-24 12:29:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:21,713 INFO L93 Difference]: Finished difference Result 1977 states and 2182 transitions. [2018-10-24 12:29:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 12:29:21,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2018-10-24 12:29:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:21,722 INFO L225 Difference]: With dead ends: 1977 [2018-10-24 12:29:21,722 INFO L226 Difference]: Without dead ends: 1972 [2018-10-24 12:29:21,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2018-10-24 12:29:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2018-10-24 12:29:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1415. [2018-10-24 12:29:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2018-10-24 12:29:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1588 transitions. [2018-10-24 12:29:22,088 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1588 transitions. Word has length 99 [2018-10-24 12:29:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:22,088 INFO L481 AbstractCegarLoop]: Abstraction has 1415 states and 1588 transitions. [2018-10-24 12:29:22,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:29:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1588 transitions. [2018-10-24 12:29:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 12:29:22,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:22,092 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:22,092 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:22,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1504345528, now seen corresponding path program 7 times [2018-10-24 12:29:22,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:22,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:22,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:22,912 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-10-24 12:29:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-24 12:29:23,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:23,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:23,488 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:23,489 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:29:23,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29: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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:23,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:29:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:23,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:23,676 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 11 treesize of output 8 [2018-10-24 12:29:23,677 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:29:23,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:23,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:23,683 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:29:23,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:24,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-24 12:29:24,132 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 23 treesize of output 11 [2018-10-24 12:29:24,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:24,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 16 [2018-10-24 12:29:24,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:24,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-10-24 12:29:24,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:24,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:29:24,232 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:29:24,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2018-10-24 12:29:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 95 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 12:29:24,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 12:29:24,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:24,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 46 [2018-10-24 12:29:24,801 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:24,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:29:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:29:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1734, Unknown=0, NotChecked=0, Total=2070 [2018-10-24 12:29:24,802 INFO L87 Difference]: Start difference. First operand 1415 states and 1588 transitions. Second operand 32 states. [2018-10-24 12:29:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:26,525 INFO L93 Difference]: Finished difference Result 1812 states and 2010 transitions. [2018-10-24 12:29:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:29:26,525 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-10-24 12:29:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:26,531 INFO L225 Difference]: With dead ends: 1812 [2018-10-24 12:29:26,531 INFO L226 Difference]: Without dead ends: 1743 [2018-10-24 12:29:26,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=509, Invalid=2571, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:29:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-10-24 12:29:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1550. [2018-10-24 12:29:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2018-10-24 12:29:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1725 transitions. [2018-10-24 12:29:27,016 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1725 transitions. Word has length 99 [2018-10-24 12:29:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:27,016 INFO L481 AbstractCegarLoop]: Abstraction has 1550 states and 1725 transitions. [2018-10-24 12:29:27,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:29:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1725 transitions. [2018-10-24 12:29:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 12:29:27,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:27,020 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:27,021 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:27,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -225111736, now seen corresponding path program 8 times [2018-10-24 12:29:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:27,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:27,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:27,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:27,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:27,610 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 12:29:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 12:29:30,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:30,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:30,342 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:30,342 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:29:30,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:30,343 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:30,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:29:30,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:29:30,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:29:30,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:30,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:30,587 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 11 treesize of output 8 [2018-10-24 12:29:30,593 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:29:30,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:30,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:30,603 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:29:30,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-24 12:29:30,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-24 12:29:30,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 20 [2018-10-24 12:29:30,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:31,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:29:31,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 12:29:31,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:31,041 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:29:31,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-10-24 12:29:31,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:31,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:31,058 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:29:31,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2018-10-24 12:29:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 12:29:31,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 35 proven. 44 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 12:29:31,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:31,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 13] total 38 [2018-10-24 12:29:31,454 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:31,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:29:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:29:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:29:31,455 INFO L87 Difference]: Start difference. First operand 1550 states and 1725 transitions. Second operand 27 states. [2018-10-24 12:29:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:32,977 INFO L93 Difference]: Finished difference Result 2074 states and 2286 transitions. [2018-10-24 12:29:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:29:32,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-10-24 12:29:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:32,982 INFO L225 Difference]: With dead ends: 2074 [2018-10-24 12:29:32,982 INFO L226 Difference]: Without dead ends: 1505 [2018-10-24 12:29:32,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:29:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-10-24 12:29:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1155. [2018-10-24 12:29:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-24 12:29:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1271 transitions. [2018-10-24 12:29:33,291 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1271 transitions. Word has length 99 [2018-10-24 12:29:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:33,292 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1271 transitions. [2018-10-24 12:29:33,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:29:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1271 transitions. [2018-10-24 12:29:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 12:29:33,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:33,295 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1] [2018-10-24 12:29:33,295 INFO L424 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:33,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 848623196, now seen corresponding path program 9 times [2018-10-24 12:29:33,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:33,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:33,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-24 12:29:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:34,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:34,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:34,376 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:29:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:34,376 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:29:34,384 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:29:34,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:29:34,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:34,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:34,539 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 11 treesize of output 8 [2018-10-24 12:29:34,541 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:29:34,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:34,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:34,546 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:29:34,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:34,813 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 16 treesize of output 12 [2018-10-24 12:29:34,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-10-24 12:29:34,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:34,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:34,817 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:29:34,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-24 12:29:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:29:34,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 12:29:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:35,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 36 [2018-10-24 12:29:35,268 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:35,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:29:35,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:29:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:29:35,269 INFO L87 Difference]: Start difference. First operand 1155 states and 1271 transitions. Second operand 26 states. [2018-10-24 12:29:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:39,545 INFO L93 Difference]: Finished difference Result 6599 states and 7404 transitions. [2018-10-24 12:29:39,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 12:29:39,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-10-24 12:29:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:39,562 INFO L225 Difference]: With dead ends: 6599 [2018-10-24 12:29:39,563 INFO L226 Difference]: Without dead ends: 6109 [2018-10-24 12:29:39,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=391, Invalid=2689, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:29:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2018-10-24 12:29:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 2246. [2018-10-24 12:29:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-24 12:29:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2478 transitions. [2018-10-24 12:29:40,149 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2478 transitions. Word has length 109 [2018-10-24 12:29:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:40,149 INFO L481 AbstractCegarLoop]: Abstraction has 2246 states and 2478 transitions. [2018-10-24 12:29:40,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:29:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2478 transitions. [2018-10-24 12:29:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 12:29:40,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:40,154 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:40,154 INFO L424 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:40,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -819368957, now seen corresponding path program 10 times [2018-10-24 12:29:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:40,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:40,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:40,780 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 12:29:40,980 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 12:29:41,292 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2018-10-24 12:29:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 76 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 12:29:41,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:41,917 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:41,917 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:41,918 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:29:41,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:41,918 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:41,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:29:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:42,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:42,061 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 11 treesize of output 8 [2018-10-24 12:29:42,063 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:29:42,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:42,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:42,072 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:29:42,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:42,274 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 15 treesize of output 11 [2018-10-24 12:29:42,277 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 11 treesize of output 3 [2018-10-24 12:29:42,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:42,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:42,283 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:29:42,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:29:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 63 proven. 98 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:29:42,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 63 proven. 45 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 12:29:42,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:42,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 11] total 38 [2018-10-24 12:29:42,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:42,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-24 12:29:42,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-24 12:29:42,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:29:42,632 INFO L87 Difference]: Start difference. First operand 2246 states and 2478 transitions. Second operand 30 states. [2018-10-24 12:29:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:44,947 INFO L93 Difference]: Finished difference Result 2479 states and 2715 transitions. [2018-10-24 12:29:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:29:44,948 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 113 [2018-10-24 12:29:44,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:44,956 INFO L225 Difference]: With dead ends: 2479 [2018-10-24 12:29:44,956 INFO L226 Difference]: Without dead ends: 2191 [2018-10-24 12:29:44,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 205 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 12:29:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2018-10-24 12:29:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2127. [2018-10-24 12:29:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2018-10-24 12:29:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2350 transitions. [2018-10-24 12:29:45,820 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2350 transitions. Word has length 113 [2018-10-24 12:29:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:45,820 INFO L481 AbstractCegarLoop]: Abstraction has 2127 states and 2350 transitions. [2018-10-24 12:29:45,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-24 12:29:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2350 transitions. [2018-10-24 12:29:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 12:29:45,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:45,823 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2018-10-24 12:29:45,823 INFO L424 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:45,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 525099466, now seen corresponding path program 11 times [2018-10-24 12:29:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:29:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:45,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:29:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-24 12:29:46,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:46,999 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:29:46,999 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:29:46,999 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:29:46,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:29:46,999 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:29:47,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:29:47,009 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:29:47,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-24 12:29:47,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:29:47,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:29:47,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 11 treesize of output 8 [2018-10-24 12:29:47,580 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:29:47,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:47,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:47,587 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:29:47,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-24 12:29:47,594 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 15 treesize of output 12 [2018-10-24 12:29:47,596 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:29:47,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:29:47,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:29:47,604 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:29:47,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 12:29:47,693 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 18 treesize of output 14 [2018-10-24 12:29:47,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-10-24 12:29:47,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:29:47,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:29:47,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:29:47,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-10-24 12:29:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-24 12:29:47,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:29:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 28 proven. 97 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-24 12:29:52,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:29:52,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 37 [2018-10-24 12:29:52,796 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:29:52,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 12:29:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 12:29:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1181, Unknown=2, NotChecked=0, Total=1332 [2018-10-24 12:29:52,797 INFO L87 Difference]: Start difference. First operand 2127 states and 2350 transitions. Second operand 24 states. [2018-10-24 12:29:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:29:57,089 INFO L93 Difference]: Finished difference Result 5652 states and 6251 transitions. [2018-10-24 12:29:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 12:29:57,090 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 126 [2018-10-24 12:29:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:29:57,108 INFO L225 Difference]: With dead ends: 5652 [2018-10-24 12:29:57,108 INFO L226 Difference]: Without dead ends: 5404 [2018-10-24 12:29:57,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=563, Invalid=2857, Unknown=2, NotChecked=0, Total=3422 [2018-10-24 12:29:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2018-10-24 12:29:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 2152. [2018-10-24 12:29:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-10-24 12:29:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2379 transitions. [2018-10-24 12:29:57,745 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2379 transitions. Word has length 126 [2018-10-24 12:29:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:29:57,746 INFO L481 AbstractCegarLoop]: Abstraction has 2152 states and 2379 transitions. [2018-10-24 12:29:57,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-24 12:29:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2379 transitions. [2018-10-24 12:29:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 12:29:57,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:29:57,749 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:29:57,749 INFO L424 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:29:57,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:29:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2025071686, now seen corresponding path program 12 times [2018-10-24 12:29:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:29:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:57,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:29:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:29:57,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:29:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 176 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-24 12:30:01,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:01,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:30:01,167 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:30:01,167 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:30:01,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:01,167 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:30:01,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:30:01,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:30:01,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:30:01,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:30:01,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:30:01,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-24 12:30:01,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-10-24 12:30:01,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:01,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:30:01,734 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:30:01,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-24 12:30:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 183 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 12:30:01,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:30:01,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-10-24 12:30:02,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 65 [2018-10-24 12:30:02,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-10-24 12:30:02,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-24 12:30:02,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:30:02,105 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 17 treesize of output 16 [2018-10-24 12:30:02,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:02,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:30:02,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:30:02,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:87 [2018-10-24 12:30:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 53 proven. 149 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 12:30:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:30:02,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 13] total 41 [2018-10-24 12:30:02,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:30:02,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:30:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:30:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 12:30:02,385 INFO L87 Difference]: Start difference. First operand 2152 states and 2379 transitions. Second operand 31 states. [2018-10-24 12:30:06,230 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-10-24 12:30:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:30:06,649 INFO L93 Difference]: Finished difference Result 5725 states and 6314 transitions. [2018-10-24 12:30:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-24 12:30:06,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-10-24 12:30:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:30:06,659 INFO L225 Difference]: With dead ends: 5725 [2018-10-24 12:30:06,659 INFO L226 Difference]: Without dead ends: 4857 [2018-10-24 12:30:06,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 235 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=716, Invalid=4396, Unknown=0, NotChecked=0, Total=5112 [2018-10-24 12:30:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2018-10-24 12:30:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3964. [2018-10-24 12:30:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3964 states. [2018-10-24 12:30:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 4407 transitions. [2018-10-24 12:30:07,732 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 4407 transitions. Word has length 129 [2018-10-24 12:30:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:30:07,732 INFO L481 AbstractCegarLoop]: Abstraction has 3964 states and 4407 transitions. [2018-10-24 12:30:07,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:30:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 4407 transitions. [2018-10-24 12:30:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 12:30:07,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:30:07,736 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-24 12:30:07,736 INFO L424 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:30:07,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:30:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 256913918, now seen corresponding path program 13 times [2018-10-24 12:30:07,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:30:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:07,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:30:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:07,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:30:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 12:30:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:08,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:30:08,444 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:30:08,444 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:30:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:08,444 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:30:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:30:08,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:30:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:08,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:30:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 12:30:08,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:30:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 12:30:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:30:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 28 [2018-10-24 12:30:09,152 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:30:09,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:30:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:30:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:30:09,154 INFO L87 Difference]: Start difference. First operand 3964 states and 4407 transitions. Second operand 18 states. [2018-10-24 12:30:13,087 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:30:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:30:14,064 INFO L93 Difference]: Finished difference Result 7122 states and 7789 transitions. [2018-10-24 12:30:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-24 12:30:14,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 129 [2018-10-24 12:30:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:30:14,077 INFO L225 Difference]: With dead ends: 7122 [2018-10-24 12:30:14,077 INFO L226 Difference]: Without dead ends: 7117 [2018-10-24 12:30:14,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 240 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=388, Invalid=4442, Unknown=0, NotChecked=0, Total=4830 [2018-10-24 12:30:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2018-10-24 12:30:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 5355. [2018-10-24 12:30:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5355 states. [2018-10-24 12:30:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5355 states to 5355 states and 5965 transitions. [2018-10-24 12:30:15,704 INFO L78 Accepts]: Start accepts. Automaton has 5355 states and 5965 transitions. Word has length 129 [2018-10-24 12:30:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:30:15,704 INFO L481 AbstractCegarLoop]: Abstraction has 5355 states and 5965 transitions. [2018-10-24 12:30:15,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:30:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5355 states and 5965 transitions. [2018-10-24 12:30:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 12:30:15,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:30:15,710 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:30:15,710 INFO L424 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:30:15,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:30:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 939254784, now seen corresponding path program 14 times [2018-10-24 12:30:15,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:30:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:15,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:30:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:15,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:30:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:16,286 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-10-24 12:30:16,854 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2018-10-24 12:30:17,035 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-10-24 12:30:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 34 proven. 174 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-24 12:30:17,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:17,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:30:17,191 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:30:17,191 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:30:17,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:17,191 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:30:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:30:17,201 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:30:17,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:30:17,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:30:17,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:30:17,657 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 15 treesize of output 12 [2018-10-24 12:30:17,663 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:30:17,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:17,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:30:17,677 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:30:17,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-10-24 12:30:19,028 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-24 12:30:19,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-10-24 12:30:19,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:30:19,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:30:19,518 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:30:19,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-10-24 12:30:19,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:19,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 13 [2018-10-24 12:30:19,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:19,570 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:30:19,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:30:19,572 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:30:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-10-24 12:30:19,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:19,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:30:19,601 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:30:19,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:12 [2018-10-24 12:30:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 106 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 12:30:19,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:30:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 161 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-24 12:30:21,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:30:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 23] total 63 [2018-10-24 12:30:21,458 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:30:21,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-24 12:30:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-24 12:30:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=3258, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 12:30:21,459 INFO L87 Difference]: Start difference. First operand 5355 states and 5965 transitions. Second operand 42 states. [2018-10-24 12:30:27,692 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-24 12:30:28,500 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-24 12:30:28,924 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-10-24 12:30:38,069 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2018-10-24 12:30:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:30:40,628 INFO L93 Difference]: Finished difference Result 10964 states and 12302 transitions. [2018-10-24 12:30:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-24 12:30:40,628 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-10-24 12:30:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:30:40,646 INFO L225 Difference]: With dead ends: 10964 [2018-10-24 12:30:40,646 INFO L226 Difference]: Without dead ends: 10450 [2018-10-24 12:30:40,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 213 SyntacticMatches, 7 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6374 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3112, Invalid=17768, Unknown=0, NotChecked=0, Total=20880 [2018-10-24 12:30:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10450 states. [2018-10-24 12:30:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10450 to 5847. [2018-10-24 12:30:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5847 states. [2018-10-24 12:30:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 6441 transitions. [2018-10-24 12:30:42,702 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 6441 transitions. Word has length 129 [2018-10-24 12:30:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:30:42,702 INFO L481 AbstractCegarLoop]: Abstraction has 5847 states and 6441 transitions. [2018-10-24 12:30:42,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-24 12:30:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 6441 transitions. [2018-10-24 12:30:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 12:30:42,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:30:42,708 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:30:42,708 INFO L424 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:30:42,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:30:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478720, now seen corresponding path program 15 times [2018-10-24 12:30:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:30:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:42,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:30:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:42,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:30:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 37 proven. 202 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 12:30:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:43,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:30:43,935 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:30:43,935 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:30:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:43,935 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:30:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:30:43,943 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:30:44,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:30:44,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:30:44,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:30:44,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-10-24 12:30:44,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 16 [2018-10-24 12:30:44,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:44,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-10-24 12:30:44,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:44,412 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 19 treesize of output 9 [2018-10-24 12:30:44,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:44,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:30:44,441 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:30:44,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:4 [2018-10-24 12:30:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 183 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 12:30:44,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:30:44,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-10-24 12:30:44,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-24 12:30:44,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:30:44,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 71 [2018-10-24 12:30:44,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2018-10-24 12:30:44,871 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 17 treesize of output 16 [2018-10-24 12:30:44,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:30:44,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:30:44,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:30:44,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:73 [2018-10-24 12:30:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 57 proven. 149 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 12:30:45,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:30:45,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 42 [2018-10-24 12:30:45,200 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:30:45,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:30:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:30:45,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1474, Unknown=0, NotChecked=0, Total=1722 [2018-10-24 12:30:45,201 INFO L87 Difference]: Start difference. First operand 5847 states and 6441 transitions. Second operand 31 states. [2018-10-24 12:30:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:30:49,050 INFO L93 Difference]: Finished difference Result 6570 states and 7237 transitions. [2018-10-24 12:30:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 12:30:49,051 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-10-24 12:30:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:30:49,060 INFO L225 Difference]: With dead ends: 6570 [2018-10-24 12:30:49,061 INFO L226 Difference]: Without dead ends: 6460 [2018-10-24 12:30:49,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 234 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=473, Invalid=2833, Unknown=0, NotChecked=0, Total=3306 [2018-10-24 12:30:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2018-10-24 12:30:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 5712. [2018-10-24 12:30:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2018-10-24 12:30:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 6296 transitions. [2018-10-24 12:30:50,829 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 6296 transitions. Word has length 129 [2018-10-24 12:30:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:30:50,830 INFO L481 AbstractCegarLoop]: Abstraction has 5712 states and 6296 transitions. [2018-10-24 12:30:50,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:30:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 6296 transitions. [2018-10-24 12:30:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 12:30:50,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:30:50,835 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 12:30:50,836 INFO L424 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:30:50,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:30:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1345596980, now seen corresponding path program 16 times [2018-10-24 12:30:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:30:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:50,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:30:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:30:50,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:30:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 111 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-24 12:30:51,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:51,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:30:51,078 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:30:51,078 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:30:51,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:30:51,078 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:30:51,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:30:51,085 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:30:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:30:51,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:30:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 144 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-24 12:30:51,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:30:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 111 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-24 12:30:51,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:30:51,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 23 [2018-10-24 12:30:51,717 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:30:51,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:30:51,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:30:51,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:30:51,718 INFO L87 Difference]: Start difference. First operand 5712 states and 6296 transitions. Second operand 18 states. [2018-10-24 12:31:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:03,846 INFO L93 Difference]: Finished difference Result 6978 states and 7629 transitions. [2018-10-24 12:31:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 12:31:03,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-24 12:31:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:03,852 INFO L225 Difference]: With dead ends: 6978 [2018-10-24 12:31:03,853 INFO L226 Difference]: Without dead ends: 4633 [2018-10-24 12:31:03,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 269 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=162, Invalid=767, Unknown=1, NotChecked=0, Total=930 [2018-10-24 12:31:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2018-10-24 12:31:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 3836. [2018-10-24 12:31:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2018-10-24 12:31:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 4195 transitions. [2018-10-24 12:31:05,212 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 4195 transitions. Word has length 142 [2018-10-24 12:31:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:05,212 INFO L481 AbstractCegarLoop]: Abstraction has 3836 states and 4195 transitions. [2018-10-24 12:31:05,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:31:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 4195 transitions. [2018-10-24 12:31:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 12:31:05,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:05,216 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:05,217 INFO L424 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:05,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 255309681, now seen corresponding path program 17 times [2018-10-24 12:31:05,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:05,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:31:05,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:05,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-24 12:31:05,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:05,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:05,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:05,885 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:31:05,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:05,885 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:31:05,892 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:31:07,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 12:31:07,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:31:07,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:07,801 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 15 treesize of output 12 [2018-10-24 12:31:07,802 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:31:07,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:07,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:07,814 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:31:07,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:10 [2018-10-24 12:31:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 45 proven. 70 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-24 12:31:08,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-24 12:31:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:10,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 28] total 54 [2018-10-24 12:31:10,202 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:10,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 12:31:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 12:31:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2488, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:31:10,203 INFO L87 Difference]: Start difference. First operand 3836 states and 4195 transitions. Second operand 28 states. [2018-10-24 12:31:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:13,797 INFO L93 Difference]: Finished difference Result 7461 states and 8086 transitions. [2018-10-24 12:31:13,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:31:13,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 142 [2018-10-24 12:31:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:13,801 INFO L225 Difference]: With dead ends: 7461 [2018-10-24 12:31:13,801 INFO L226 Difference]: Without dead ends: 3645 [2018-10-24 12:31:13,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=752, Invalid=4218, Unknown=0, NotChecked=0, Total=4970 [2018-10-24 12:31:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2018-10-24 12:31:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2740. [2018-10-24 12:31:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-10-24 12:31:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 2884 transitions. [2018-10-24 12:31:14,688 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 2884 transitions. Word has length 142 [2018-10-24 12:31:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:14,688 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 2884 transitions. [2018-10-24 12:31:14,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 12:31:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 2884 transitions. [2018-10-24 12:31:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-24 12:31:14,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:14,691 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:14,691 INFO L424 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:14,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1289049915, now seen corresponding path program 18 times [2018-10-24 12:31:14,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:14,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:14,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:31:14,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:14,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 124 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 12:31:16,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:16,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:16,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:16,097 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:31:16,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:16,097 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:16,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:31:16,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:31:16,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:31:16,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:31:16,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:16,313 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 11 treesize of output 8 [2018-10-24 12:31:16,315 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:31:16,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:16,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:16,320 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:31:16,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:31:16,520 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 15 treesize of output 11 [2018-10-24 12:31:16,521 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 11 treesize of output 3 [2018-10-24 12:31:16,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:16,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:16,524 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:31:16,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:31:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 93 proven. 154 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-24 12:31:16,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 93 proven. 117 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-24 12:31:17,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:17,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 13] total 45 [2018-10-24 12:31:17,136 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:17,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-24 12:31:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-24 12:31:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 12:31:17,137 INFO L87 Difference]: Start difference. First operand 2740 states and 2884 transitions. Second operand 35 states. [2018-10-24 12:31:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:19,788 INFO L93 Difference]: Finished difference Result 3426 states and 3582 transitions. [2018-10-24 12:31:19,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:31:19,788 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2018-10-24 12:31:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:19,790 INFO L225 Difference]: With dead ends: 3426 [2018-10-24 12:31:19,790 INFO L226 Difference]: Without dead ends: 2589 [2018-10-24 12:31:19,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 261 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=435, Invalid=2645, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:31:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-10-24 12:31:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2522. [2018-10-24 12:31:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2018-10-24 12:31:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 2639 transitions. [2018-10-24 12:31:20,714 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 2639 transitions. Word has length 143 [2018-10-24 12:31:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:20,714 INFO L481 AbstractCegarLoop]: Abstraction has 2522 states and 2639 transitions. [2018-10-24 12:31:20,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-24 12:31:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 2639 transitions. [2018-10-24 12:31:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 12:31:20,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:20,717 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:20,718 INFO L424 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:20,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash -980482660, now seen corresponding path program 19 times [2018-10-24 12:31:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:20,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:20,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:31:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:20,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 44 proven. 346 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 12:31:22,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:22,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:22,700 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:22,700 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:31:22,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:22,700 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:22,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:31:22,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:31:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:22,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:23,073 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 11 treesize of output 8 [2018-10-24 12:31:23,075 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:31:23,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:23,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:23,082 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:31:23,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:31:23,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-24 12:31:23,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-10-24 12:31:23,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:23,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:23,538 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:31:23,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-24 12:31:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 74 proven. 384 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 12:31:23,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 138 proven. 250 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-24 12:31:24,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:24,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 17] total 55 [2018-10-24 12:31:24,506 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:24,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 12:31:24,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 12:31:24,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2649, Unknown=0, NotChecked=0, Total=2970 [2018-10-24 12:31:24,508 INFO L87 Difference]: Start difference. First operand 2522 states and 2639 transitions. Second operand 41 states. [2018-10-24 12:31:26,411 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-24 12:31:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:29,491 INFO L93 Difference]: Finished difference Result 3637 states and 3778 transitions. [2018-10-24 12:31:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-24 12:31:29,492 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 159 [2018-10-24 12:31:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:29,494 INFO L225 Difference]: With dead ends: 3637 [2018-10-24 12:31:29,494 INFO L226 Difference]: Without dead ends: 2843 [2018-10-24 12:31:29,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 284 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2670 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1043, Invalid=7887, Unknown=0, NotChecked=0, Total=8930 [2018-10-24 12:31:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2018-10-24 12:31:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2471. [2018-10-24 12:31:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-10-24 12:31:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 2555 transitions. [2018-10-24 12:31:30,397 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 2555 transitions. Word has length 159 [2018-10-24 12:31:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:30,398 INFO L481 AbstractCegarLoop]: Abstraction has 2471 states and 2555 transitions. [2018-10-24 12:31:30,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 12:31:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2555 transitions. [2018-10-24 12:31:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 12:31:30,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:30,401 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:30,401 INFO L424 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:30,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -926764960, now seen corresponding path program 20 times [2018-10-24 12:31:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:31:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:30,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-24 12:31:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:31,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:31,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:31,095 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:31:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:31,095 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:31:31,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:31:31,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 12:31:31,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:31:31,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 3 proven. 399 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 12:31:32,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 387 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-24 12:31:32,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:32,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 16] total 39 [2018-10-24 12:31:32,848 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:32,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:31:32,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:31:32,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-10-24 12:31:32,849 INFO L87 Difference]: Start difference. First operand 2471 states and 2555 transitions. Second operand 25 states. [2018-10-24 12:31:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:35,480 INFO L93 Difference]: Finished difference Result 3038 states and 3142 transitions. [2018-10-24 12:31:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 12:31:35,480 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 159 [2018-10-24 12:31:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:35,483 INFO L225 Difference]: With dead ends: 3038 [2018-10-24 12:31:35,483 INFO L226 Difference]: Without dead ends: 3033 [2018-10-24 12:31:35,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 12:31:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2018-10-24 12:31:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 2247. [2018-10-24 12:31:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2018-10-24 12:31:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 2331 transitions. [2018-10-24 12:31:36,305 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 2331 transitions. Word has length 159 [2018-10-24 12:31:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:36,306 INFO L481 AbstractCegarLoop]: Abstraction has 2247 states and 2331 transitions. [2018-10-24 12:31:36,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:31:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2331 transitions. [2018-10-24 12:31:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 12:31:36,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:36,309 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:36,309 INFO L424 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:36,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash -471894302, now seen corresponding path program 21 times [2018-10-24 12:31:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:36,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:31:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:36,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:37,027 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-24 12:31:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 46 proven. 344 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 12:31:38,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:38,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:38,205 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:38,205 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:31:38,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:38,205 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:38,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:31:38,214 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:31:38,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:31:38,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:31:38,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:39,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-10-24 12:31:39,162 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-10-24 12:31:39,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:31:39,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-10-24 12:31:39,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:39,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 30 treesize of output 19 [2018-10-24 12:31:39,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:39,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:31:39,242 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:31:39,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:4 [2018-10-24 12:31:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 44 proven. 399 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-24 12:31:39,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:40,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-10-24 12:31:40,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 63 [2018-10-24 12:31:40,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-24 12:31:40,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 158 [2018-10-24 12:31:40,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-24 12:31:40,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 31 xjuncts. [2018-10-24 12:31:40,842 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 49 [2018-10-24 12:31:40,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:31:40,861 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 47 [2018-10-24 12:31:40,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:31:40,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:31:40,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:31:40,993 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:65, output treesize:137 [2018-10-24 12:31:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 60 proven. 346 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 12:31:43,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:43,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 26] total 68 [2018-10-24 12:31:43,697 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:43,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-24 12:31:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-24 12:31:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=4061, Unknown=0, NotChecked=0, Total=4556 [2018-10-24 12:31:43,698 INFO L87 Difference]: Start difference. First operand 2247 states and 2331 transitions. Second operand 45 states. [2018-10-24 12:31:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:48,783 INFO L93 Difference]: Finished difference Result 2733 states and 2828 transitions. [2018-10-24 12:31:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-24 12:31:48,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 159 [2018-10-24 12:31:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:48,787 INFO L225 Difference]: With dead ends: 2733 [2018-10-24 12:31:48,787 INFO L226 Difference]: Without dead ends: 2710 [2018-10-24 12:31:48,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 270 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3204 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1052, Invalid=7878, Unknown=0, NotChecked=0, Total=8930 [2018-10-24 12:31:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2018-10-24 12:31:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2517. [2018-10-24 12:31:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2517 states. [2018-10-24 12:31:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 2602 transitions. [2018-10-24 12:31:49,875 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 2602 transitions. Word has length 159 [2018-10-24 12:31:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:49,876 INFO L481 AbstractCegarLoop]: Abstraction has 2517 states and 2602 transitions. [2018-10-24 12:31:49,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-24 12:31:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 2602 transitions. [2018-10-24 12:31:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 12:31:49,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:49,879 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:49,879 INFO L424 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:49,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 807339490, now seen corresponding path program 22 times [2018-10-24 12:31:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:49,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:31:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:49,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 74 proven. 311 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-24 12:31:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:50,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:31:50,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:31:50,909 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:31:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:31:50,909 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:31:51,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:31:51,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:31:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:51,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:31:51,382 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 11 treesize of output 8 [2018-10-24 12:31:51,384 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:31:51,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:51,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:31:51,391 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:31:51,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:31:51,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-10-24 12:31:51,729 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 19 treesize of output 9 [2018-10-24 12:31:51,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:51,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 16 [2018-10-24 12:31:51,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:51,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-10-24 12:31:51,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:31:51,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:31:51,776 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:31:51,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:4 [2018-10-24 12:31:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 74 proven. 384 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 12:31:51,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:31:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 117 proven. 275 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-24 12:31:52,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:31:52,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 18] total 53 [2018-10-24 12:31:52,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:31:52,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-24 12:31:52,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-24 12:31:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2416, Unknown=0, NotChecked=0, Total=2756 [2018-10-24 12:31:52,452 INFO L87 Difference]: Start difference. First operand 2517 states and 2602 transitions. Second operand 38 states. [2018-10-24 12:31:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:31:55,579 INFO L93 Difference]: Finished difference Result 2585 states and 2677 transitions. [2018-10-24 12:31:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 12:31:55,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 159 [2018-10-24 12:31:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:31:55,582 INFO L225 Difference]: With dead ends: 2585 [2018-10-24 12:31:55,582 INFO L226 Difference]: Without dead ends: 2562 [2018-10-24 12:31:55,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 283 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=523, Invalid=3899, Unknown=0, NotChecked=0, Total=4422 [2018-10-24 12:31:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-10-24 12:31:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2517. [2018-10-24 12:31:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2517 states. [2018-10-24 12:31:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 2601 transitions. [2018-10-24 12:31:56,668 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 2601 transitions. Word has length 159 [2018-10-24 12:31:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:31:56,668 INFO L481 AbstractCegarLoop]: Abstraction has 2517 states and 2601 transitions. [2018-10-24 12:31:56,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-24 12:31:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 2601 transitions. [2018-10-24 12:31:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 12:31:56,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:31:56,671 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 10, 10, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:31:56,672 INFO L424 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:31:56,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:31:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -82705891, now seen corresponding path program 23 times [2018-10-24 12:31:56,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:31:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:31:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:31:56,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:31:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:31:57,291 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2018-10-24 12:31:57,523 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-24 12:31:58,052 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2018-10-24 12:31:58,252 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2018-10-24 12:32:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 123 proven. 192 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-24 12:32:00,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:32:00,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:32:00,626 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:32:00,626 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:32:00,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:32:00,627 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:32:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:32:00,637 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:32:02,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-24 12:32:02,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:32:02,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:32:02,346 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 15 treesize of output 12 [2018-10-24 12:32:02,347 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:32:02,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:32:02,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:32:02,358 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:32:02,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:10 [2018-10-24 12:32:02,379 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 15 treesize of output 12 [2018-10-24 12:32:02,381 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:32:02,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:32:02,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:32:02,393 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:32:02,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:10 [2018-10-24 12:32:03,025 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-24 12:32:04,904 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-24 12:32:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 208 proven. 295 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-24 12:32:06,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:32:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 5 proven. 450 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-10-24 12:32:13,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:32:13,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 40, 41] total 86 [2018-10-24 12:32:13,448 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:32:13,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-24 12:32:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-24 12:32:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1268, Invalid=6041, Unknown=1, NotChecked=0, Total=7310 [2018-10-24 12:32:13,450 INFO L87 Difference]: Start difference. First operand 2517 states and 2601 transitions. Second operand 47 states. Received shutdown request... [2018-10-24 12:32:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 12:32:14,874 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:32:14,877 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:32:14,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:32:14 BoogieIcfgContainer [2018-10-24 12:32:14,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:32:14,879 INFO L168 Benchmark]: Toolchain (without parser) took 236930.55 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 12:32:14,879 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:32:14,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.87 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:32:14,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.60 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:32:14,880 INFO L168 Benchmark]: Boogie Preprocessor took 36.86 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:32:14,880 INFO L168 Benchmark]: RCFGBuilder took 774.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.4 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-10-24 12:32:14,881 INFO L168 Benchmark]: TraceAbstraction took 235778.39 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 12:32:14,882 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.87 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 46.60 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 36.86 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 774.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.4 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235778.39 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was constructing difference of abstraction (2517states) and FLOYD_HOARE automaton (currently 21 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 99 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. TIMEOUT Result, 235.7s OverallTime, 39 OverallIterations, 15 TraceHistogramMax, 108.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3459 SDtfs, 13953 SDslu, 35969 SDs, 0 SdLazy, 27423 SolverSat, 2779 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 37.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 8304 GetRequests, 6386 SyntacticMatches, 153 SemanticMatches, 1764 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 34742 ImplicationChecksByTransitivity, 119.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5847occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 12 AbstIntIterations, 1 AbstIntStrong, 0.7583278330081398 AbsIntWeakeningRatio, 1.8846153846153846 AbsIntAvgWeakeningVarsNumRemoved, -0.15384615384615385 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 24311 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 9.1s SatisfiabilityAnalysisTime, 91.9s InterpolantComputationTime, 7235 NumberOfCodeBlocks, 7094 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 10707 ConstructedInterpolants, 258 QuantifiedInterpolants, 17572251 SizeOfPredicates, 657 NumberOfNonLiveVariables, 14794 ConjunctsInSsa, 1999 ConjunctsInUnsatCore, 111 InterpolantComputations, 8 PerfectInterpolantSequences, 11620/22508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown