java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:33:54,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:33:54,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:33:54,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:33:54,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:33:54,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:33:54,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:33:54,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:33:54,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:33:54,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:33:54,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:33:54,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:33:54,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:33:54,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:33:54,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:33:54,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:33:54,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:33:54,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:33:54,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:33:54,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:33:54,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:33:54,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:33:54,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:33:54,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:33:54,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:33:54,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:33:54,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:33:54,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:33:54,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:33:54,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:33:54,203 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:33:54,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:33:54,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:33:54,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:33:54,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:33:54,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:33:54,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:33:54,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:33:54,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:33:54,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:33:54,238 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:33:54,238 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:33:54,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:33:54,238 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:33:54,239 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:33:54,239 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:33:54,239 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:33:54,239 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:33:54,240 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:33:54,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:33:54,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:33:54,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:33:54,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:33:54,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:33:54,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:33:54,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:33:54,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:33:54,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:33:54,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:33:54,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:33:54,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:33:54,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:33:54,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:33:54,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:33:54,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:33:54,244 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:33:54,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:33:54,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:33:54,244 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:33:54,245 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:33:54,245 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:33:54,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:33:54,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:33:54,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:33:54,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:33:54,315 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:33:54,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-07 16:33:54,388 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb788ba5/48c6e70c81ed480f9c6cab95e2f0a09e/FLAG9ee057cd3 [2018-11-07 16:33:54,804 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:33:54,805 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-07 16:33:54,812 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb788ba5/48c6e70c81ed480f9c6cab95e2f0a09e/FLAG9ee057cd3 [2018-11-07 16:33:54,832 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb788ba5/48c6e70c81ed480f9c6cab95e2f0a09e [2018-11-07 16:33:54,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:33:54,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:33:54,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:54,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:33:54,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:33:54,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:54" (1/1) ... [2018-11-07 16:33:54,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6fe57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:54, skipping insertion in model container [2018-11-07 16:33:54,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:54" (1/1) ... [2018-11-07 16:33:54,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:33:54,888 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:33:55,128 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:55,133 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:33:55,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:55,181 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:33:55,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55 WrapperNode [2018-11-07 16:33:55,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:55,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:55,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:33:55,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:33:55,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:55,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:33:55,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:33:55,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:33:55,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... [2018-11-07 16:33:55,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:33:55,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:33:55,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:33:55,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:33:55,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:33:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:33:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:33:55,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:33:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:33:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:33:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:33:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:33:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:33:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:33:55,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:33:55,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:33:55,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:33:55,889 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:33:55,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:55 BoogieIcfgContainer [2018-11-07 16:33:55,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:33:55,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:33:55,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:33:55,894 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:33:55,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:33:54" (1/3) ... [2018-11-07 16:33:55,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac84b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:55, skipping insertion in model container [2018-11-07 16:33:55,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:55" (2/3) ... [2018-11-07 16:33:55,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac84b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:55, skipping insertion in model container [2018-11-07 16:33:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:55" (3/3) ... [2018-11-07 16:33:55,898 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-07 16:33:55,908 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:33:55,918 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:33:55,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:33:55,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:33:55,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:33:55,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:33:55,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:33:55,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:33:55,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:33:55,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:33:55,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:33:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 16:33:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:33:56,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:56,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:56,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:56,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash 369743628, now seen corresponding path program 1 times [2018-11-07 16:33:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:56,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:56,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:33:56,181 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:56,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:33:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:33:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:33:56,201 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-07 16:33:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:56,226 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-07 16:33:56,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:33:56,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 16:33:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:56,237 INFO L225 Difference]: With dead ends: 80 [2018-11-07 16:33:56,238 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:33:56,241 INFO L604 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-11-07 16:33:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:33:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 16:33:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:33:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 16:33:56,281 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-11-07 16:33:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:56,282 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 16:33:56,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:33:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 16:33:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:33:56,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:56,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:56,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:56,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 994502583, now seen corresponding path program 1 times [2018-11-07 16:33:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:56,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:56,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:33:56,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:56,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:33:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:33:56,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:33:56,510 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-11-07 16:33:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:56,701 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-07 16:33:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:33:56,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 16:33:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:56,704 INFO L225 Difference]: With dead ends: 68 [2018-11-07 16:33:56,704 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:33:56,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:33:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-07 16:33:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:33:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 16:33:56,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2018-11-07 16:33:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:56,715 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 16:33:56,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:33:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 16:33:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:33:56,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:56,718 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, 1, 1] [2018-11-07 16:33:56,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:56,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 385502281, now seen corresponding path program 1 times [2018-11-07 16:33:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:57,002 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 16:33:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:33:57,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:57,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:33:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:33:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:33:57,015 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-11-07 16:33:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:57,248 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-07 16:33:57,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:33:57,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 16:33:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:57,254 INFO L225 Difference]: With dead ends: 92 [2018-11-07 16:33:57,254 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 16:33:57,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 16:33:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-11-07 16:33:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:33:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-07 16:33:57,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2018-11-07 16:33:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:57,270 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-07 16:33:57,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:33:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-07 16:33:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:33:57,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:57,271 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, 1, 1, 1, 1] [2018-11-07 16:33:57,274 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:57,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1987166342, now seen corresponding path program 1 times [2018-11-07 16:33:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:57,795 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 16:33:58,486 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-07 16:33:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:58,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:58,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:58,735 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 16:33:58,737 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 16:33:58,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:33:58,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:33:58,915 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:33:59,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:33:59,195 INFO L272 AbstractInterpreter]: Visited 30 different actions 154 times. Merged at 18 different actions 103 times. Widened at 3 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 16:33:59,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:59,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:33:59,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:59,240 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:59,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:59,253 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:59,862 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 28 treesize of output 23 [2018-11-07 16:33:59,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:59,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:33:59,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:59,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:59,919 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-11-07 16:33:59,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 16:34:00,081 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 26 treesize of output 18 [2018-11-07 16:34:00,122 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:34:00,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:34:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:00,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:02,585 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 43 treesize of output 37 [2018-11-07 16:34:02,660 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,662 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 16:34:02,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:02,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,678 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 16:34:02,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:02,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:02,696 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 16:34:02,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:02,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:34:02,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:02,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 16:34:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:02,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:02,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2018-11-07 16:34:02,959 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:02,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:34:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:34:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1071, Unknown=1, NotChecked=0, Total=1260 [2018-11-07 16:34:02,962 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 24 states. [2018-11-07 16:34:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:04,092 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-07 16:34:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:34:04,093 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-07 16:34:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:04,097 INFO L225 Difference]: With dead ends: 104 [2018-11-07 16:34:04,097 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 16:34:04,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=380, Invalid=1781, Unknown=1, NotChecked=0, Total=2162 [2018-11-07 16:34:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 16:34:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2018-11-07 16:34:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 16:34:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-07 16:34:04,114 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 31 [2018-11-07 16:34:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:04,115 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-07 16:34:04,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:34:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-07 16:34:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 16:34:04,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:04,117 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:04,117 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:04,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash -456310597, now seen corresponding path program 1 times [2018-11-07 16:34:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:04,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:05,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:05,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:05,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-07 16:34:05,044 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 16:34:05,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:05,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:05,058 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:05,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:05,299 INFO L272 AbstractInterpreter]: Visited 35 different actions 185 times. Merged at 23 different actions 115 times. Widened at 4 different actions 5 times. Found 17 fixpoints after 8 different actions. Largest state had 25 variables. [2018-11-07 16:34:05,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:05,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:05,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:05,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:05,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:05,321 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:05,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:05,605 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 41 treesize of output 34 [2018-11-07 16:34:05,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:05,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:34:05,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:05,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:05,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:05,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:34:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:34:06,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,062 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:06,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 16:34:06,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:06,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:06,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 16:34:06,481 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 39 treesize of output 31 [2018-11-07 16:34:06,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,506 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:06,506 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:06,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:06,509 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 16:34:06,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:06,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:06,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:06,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 16:34:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:06,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:12,353 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 72 treesize of output 64 [2018-11-07 16:34:12,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 16:34:12,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,520 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,552 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 16:34:12,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:12,557 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:12,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:12,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,562 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 92 [2018-11-07 16:34:12,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:12,605 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,652 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 16:34:12,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:12,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-11-07 16:34:12,663 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:12,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,673 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:34:12,693 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:12,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:12,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 16:34:12,730 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:12,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:12,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:12,785 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 16:34:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:12,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:12,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 50 [2018-11-07 16:34:12,887 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:12,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:34:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:34:12,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2169, Unknown=2, NotChecked=0, Total=2450 [2018-11-07 16:34:12,890 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 35 states. [2018-11-07 16:34:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:14,854 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2018-11-07 16:34:14,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:34:14,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-11-07 16:34:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:14,858 INFO L225 Difference]: With dead ends: 204 [2018-11-07 16:34:14,859 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 16:34:14,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=612, Invalid=4216, Unknown=2, NotChecked=0, Total=4830 [2018-11-07 16:34:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 16:34:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 78. [2018-11-07 16:34:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 16:34:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-07 16:34:14,876 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 38 [2018-11-07 16:34:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:14,877 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-07 16:34:14,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:34:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-07 16:34:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:34:14,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:14,879 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 16:34:14,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:14,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1097051736, now seen corresponding path program 1 times [2018-11-07 16:34:14,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:14,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:14,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:14,982 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 16:34:14,982 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 16:34:14,987 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:14,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:14,995 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:15,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:15,110 INFO L272 AbstractInterpreter]: Visited 31 different actions 164 times. Merged at 19 different actions 106 times. Widened at 3 different actions 5 times. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 16:34:15,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:15,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:15,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:15,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:15,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:15,168 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:15,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2018-11-07 16:34:15,697 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:15,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:34:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:34:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:34:15,698 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 8 states. [2018-11-07 16:34:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:15,938 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2018-11-07 16:34:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:34:15,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 16:34:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:15,941 INFO L225 Difference]: With dead ends: 170 [2018-11-07 16:34:15,941 INFO L226 Difference]: Without dead ends: 110 [2018-11-07 16:34:15,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:34:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-07 16:34:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2018-11-07 16:34:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 16:34:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-07 16:34:15,953 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 41 [2018-11-07 16:34:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:15,953 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-07 16:34:15,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:34:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-07 16:34:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 16:34:15,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:15,955 INFO L375 BasicCegarLoop]: trace histogram [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-11-07 16:34:15,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:15,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -429526962, now seen corresponding path program 1 times [2018-11-07 16:34:15,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:15,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:16,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:16,291 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:16,291 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-07 16:34:16,291 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [44], [46], [50], [54], [59], [60], [61], [63], [65], [73], [76], [78], [81], [83], [84], [85], [86], [88], [89] [2018-11-07 16:34:16,295 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:16,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:16,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:16,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:16,537 INFO L272 AbstractInterpreter]: Visited 35 different actions 236 times. Merged at 21 different actions 141 times. Widened at 4 different actions 8 times. Found 8 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-07 16:34:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:16,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:16,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:16,573 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:34:16,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:16,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:16,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:16,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-11-07 16:34:17,161 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:34:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:34:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:34:17,163 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2018-11-07 16:34:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:17,331 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-11-07 16:34:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:34:17,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-07 16:34:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:17,334 INFO L225 Difference]: With dead ends: 150 [2018-11-07 16:34:17,334 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 16:34:17,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:34:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 16:34:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2018-11-07 16:34:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 16:34:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-07 16:34:17,353 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2018-11-07 16:34:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:17,356 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-07 16:34:17,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:34:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-07 16:34:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:34:17,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:17,358 INFO L375 BasicCegarLoop]: trace histogram [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-11-07 16:34:17,358 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:17,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1408574763, now seen corresponding path program 2 times [2018-11-07 16:34:17,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:17,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:17,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:18,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:18,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:18,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:18,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:18,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:18,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:34:18,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:18,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:18,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:34:18,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:18,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:18,586 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 28 treesize of output 23 [2018-11-07 16:34:18,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:18,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:34:18,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 16:34:18,754 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 33 treesize of output 24 [2018-11-07 16:34:18,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:18,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:18,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:18,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 43 [2018-11-07 16:34:18,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-11-07 16:34:18,846 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 26 treesize of output 18 [2018-11-07 16:34:18,896 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:34:18,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:18,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:34:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:18,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:19,510 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 93 treesize of output 83 [2018-11-07 16:34:19,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-11-07 16:34:19,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,626 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 73 [2018-11-07 16:34:19,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 16:34:19,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:19,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:19,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 113 [2018-11-07 16:34:20,204 WARN L179 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2018-11-07 16:34:20,209 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,211 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 87 [2018-11-07 16:34:20,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:20,240 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 16:34:20,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 16:34:20,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,321 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 16:34:20,324 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 16:34:20,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 16:34:20,351 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:20,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:34:20,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2018-11-07 16:34:20,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:20,503 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 68 [2018-11-07 16:34:20,504 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:20,522 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:20,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:20,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:20,544 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:96, output treesize:14 [2018-11-07 16:34:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 45 [2018-11-07 16:34:20,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:20,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:34:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:34:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:34:20,688 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 27 states. [2018-11-07 16:34:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:21,999 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2018-11-07 16:34:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:34:21,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-07 16:34:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:22,002 INFO L225 Difference]: With dead ends: 188 [2018-11-07 16:34:22,002 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 16:34:22,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=585, Invalid=3075, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:34:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 16:34:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2018-11-07 16:34:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 16:34:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-11-07 16:34:22,019 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 43 [2018-11-07 16:34:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:22,023 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-11-07 16:34:22,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:34:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-07 16:34:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:34:22,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:22,025 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-07 16:34:22,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:22,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash -836780148, now seen corresponding path program 2 times [2018-11-07 16:34:22,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:22,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:22,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:22,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:22,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:22,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:22,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:22,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:22,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:34:22,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:22,876 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:22,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:34:22,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:22,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:22,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:23,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:23,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2018-11-07 16:34:23,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:23,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:34:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:34:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:34:23,169 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 9 states. [2018-11-07 16:34:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:23,439 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2018-11-07 16:34:23,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:34:23,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-07 16:34:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:23,441 INFO L225 Difference]: With dead ends: 222 [2018-11-07 16:34:23,441 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 16:34:23,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:34:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 16:34:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-11-07 16:34:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 16:34:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-11-07 16:34:23,457 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 50 [2018-11-07 16:34:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:23,458 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-11-07 16:34:23,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:34:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-11-07 16:34:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:34:23,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:23,460 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-07 16:34:23,460 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:23,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1313256330, now seen corresponding path program 3 times [2018-11-07 16:34:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:23,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:23,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:23,739 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 16:34:24,041 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-07 16:34:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:24,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:24,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:24,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:24,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:24,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:24,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:34:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:34:24,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:34:24,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:34:24,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:24,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:25,380 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 41 treesize of output 34 [2018-11-07 16:34:25,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:34:25,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 16:34:25,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:34:25,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:25,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2018-11-07 16:34:25,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,694 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 1 xjuncts. [2018-11-07 16:34:25,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:38 [2018-11-07 16:34:25,968 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 37 treesize of output 30 [2018-11-07 16:34:25,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:25,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 91 [2018-11-07 16:34:25,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:26,009 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 1 xjuncts. [2018-11-07 16:34:26,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:35 [2018-11-07 16:34:26,775 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 40 treesize of output 32 [2018-11-07 16:34:26,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:26,778 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:26,780 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:26,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:26,783 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-11-07 16:34:26,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:26,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:26,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 16:34:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:26,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:29,031 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:34:31,073 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:34:51,531 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 16:35:02,602 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-07 16:35:10,653 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 88 treesize of output 80 [2018-11-07 16:35:10,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:10,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 87 [2018-11-07 16:35:10,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:10,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:10,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:10,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 16:35:11,115 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 16:35:11,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,190 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,228 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,240 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,258 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,411 INFO L303 Elim1Store]: Index analysis took 292 ms [2018-11-07 16:35:11,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 132 [2018-11-07 16:35:11,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:11,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,426 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,426 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,427 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,428 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 134 [2018-11-07 16:35:11,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:11,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 135 [2018-11-07 16:35:11,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:11,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,602 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,625 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,681 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,746 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,755 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:11,875 INFO L303 Elim1Store]: Index analysis took 334 ms [2018-11-07 16:35:11,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 132 [2018-11-07 16:35:11,953 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:11,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,004 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,042 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,080 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,148 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,175 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,197 INFO L303 Elim1Store]: Index analysis took 243 ms [2018-11-07 16:35:12,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 134 [2018-11-07 16:35:12,206 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:12,210 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,211 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 16:35:12,231 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:12,234 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,234 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,235 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,235 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,236 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,237 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,240 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 99 [2018-11-07 16:35:12,251 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:12,569 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,571 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,571 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,572 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,577 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,578 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,596 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 2 case distinctions, treesize of input 51 treesize of output 93 [2018-11-07 16:35:12,600 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-07 16:35:12,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,616 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 1 case distinctions, treesize of input 45 treesize of output 60 [2018-11-07 16:35:12,618 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:12,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,764 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-07 16:35:12,932 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2018-11-07 16:35:12,933 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 16:35:13,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,465 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,474 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 55 [2018-11-07 16:35:13,476 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:13,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-07 16:35:13,521 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,527 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,535 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 88 [2018-11-07 16:35:13,557 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:13,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-07 16:35:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 16:35:13,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 16:35:13,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-11-07 16:35:13,857 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:96, output treesize:63 [2018-11-07 16:35:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2018-11-07 16:35:27,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:27,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 22] total 63 [2018-11-07 16:35:27,035 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:27,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:35:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:35:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3241, Unknown=23, NotChecked=238, Total=3906 [2018-11-07 16:35:27,039 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 44 states. [2018-11-07 16:35:28,816 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-07 16:35:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:30,413 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-11-07 16:35:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:35:30,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2018-11-07 16:35:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:30,416 INFO L225 Difference]: With dead ends: 173 [2018-11-07 16:35:30,416 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 16:35:30,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=813, Invalid=5652, Unknown=23, NotChecked=318, Total=6806 [2018-11-07 16:35:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 16:35:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 125. [2018-11-07 16:35:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 16:35:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-11-07 16:35:30,432 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 50 [2018-11-07 16:35:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:30,432 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-11-07 16:35:30,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:35:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-11-07 16:35:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 16:35:30,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:30,434 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-07 16:35:30,434 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:30,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash -100176119, now seen corresponding path program 1 times [2018-11-07 16:35:30,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:30,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:30,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:35:30,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:30,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:30,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:30,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:30,861 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 16:35:30,861 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 16:35:30,863 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:35:30,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:35:30,869 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:35:30,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:35:30,959 INFO L272 AbstractInterpreter]: Visited 34 different actions 185 times. Merged at 22 different actions 124 times. Widened at 4 different actions 6 times. Found 9 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 16:35:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:31,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:35:31,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:31,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:35:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:31,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:35:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:31,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:31,208 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 28 treesize of output 23 [2018-11-07 16:35:31,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:31,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:35:31,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,228 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-11-07 16:35:31,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-07 16:35:31,288 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 26 treesize of output 18 [2018-11-07 16:35:31,291 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:35:31,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:35:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:31,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:31,449 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 43 treesize of output 37 [2018-11-07 16:35:31,496 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,498 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 16:35:31,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,506 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,522 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 16:35:31,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:31,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:31,538 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 16:35:31,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:31,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:35:31,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:31,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 16:35:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:31,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:31,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 34 [2018-11-07 16:35:31,990 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:31,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:35:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:35:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:35:31,992 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 20 states. [2018-11-07 16:35:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:33,885 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2018-11-07 16:35:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:35:33,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-11-07 16:35:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:33,889 INFO L225 Difference]: With dead ends: 288 [2018-11-07 16:35:33,889 INFO L226 Difference]: Without dead ends: 286 [2018-11-07 16:35:33,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=656, Invalid=3504, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 16:35:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-07 16:35:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 158. [2018-11-07 16:35:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-07 16:35:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-11-07 16:35:33,909 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 52 [2018-11-07 16:35:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:33,909 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-11-07 16:35:33,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:35:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-11-07 16:35:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 16:35:33,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:33,910 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:35:33,911 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:33,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:33,911 INFO L82 PathProgramCache]: Analyzing trace with hash -775250273, now seen corresponding path program 2 times [2018-11-07 16:35:33,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:33,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:33,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:34,227 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-07 16:35:34,809 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-07 16:35:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:35,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:35,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:35,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:35:35,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:35:35,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:35,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:35:35,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:35:35,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:35:35,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:35:35,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:35:35,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:35,365 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 23 treesize of output 18 [2018-11-07 16:35:35,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:35,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-07 16:35:35,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-07 16:35:35,646 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 26 treesize of output 18 [2018-11-07 16:35:35,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:35:35,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:35:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:35,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:35,930 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 47 treesize of output 41 [2018-11-07 16:35:35,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:35,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:35,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:35,990 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 53 [2018-11-07 16:35:35,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:35,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:35,996 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-07 16:35:35,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:35,999 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:36,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:36,002 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:36,011 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 51 [2018-11-07 16:35:36,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:36,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:36,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:36,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 16:35:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 39 [2018-11-07 16:35:36,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:36,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:35:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:35:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:35:36,377 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 34 states. [2018-11-07 16:35:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:53,991 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-11-07 16:35:53,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:35:53,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-07 16:35:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:53,994 INFO L225 Difference]: With dead ends: 235 [2018-11-07 16:35:53,994 INFO L226 Difference]: Without dead ends: 233 [2018-11-07 16:35:53,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=417, Invalid=3243, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:35:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-07 16:35:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 178. [2018-11-07 16:35:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-07 16:35:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-11-07 16:35:54,013 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 54 [2018-11-07 16:35:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:54,013 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-11-07 16:35:54,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:35:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2018-11-07 16:35:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:35:54,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:54,015 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-11-07 16:35:54,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:54,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1414645976, now seen corresponding path program 4 times [2018-11-07 16:35:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:54,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:35:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:54,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:55,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:55,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:55,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:35:55,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:35:55,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:55,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:35:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:55,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:35:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:55,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:55,284 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 41 treesize of output 34 [2018-11-07 16:35:55,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:55,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:35:55,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:55,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:55,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:55,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:35:55,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:55,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:35:55,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:55,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:55,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:55,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-07 16:35:55,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:55,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:55,505 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 1 xjuncts. [2018-11-07 16:35:55,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:35 [2018-11-07 16:35:56,210 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 40 treesize of output 32 [2018-11-07 16:35:56,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:56,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:56,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:56,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:56,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:56,217 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-11-07 16:35:56,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:56,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:56,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:56,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 16:35:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:56,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:59,130 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 72 treesize of output 64 [2018-11-07 16:35:59,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 16:35:59,230 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:35:59,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:59,232 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:35:59,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:59,235 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,261 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 16:35:59,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:59,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,321 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,333 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 16:35:59,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:59,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,348 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,348 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,351 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,351 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:35:59,365 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:59,367 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-11-07 16:35:59,371 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:59,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:59,392 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 16:35:59,393 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:59,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:59,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:59,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:35:59,440 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 16:35:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 16:35:59,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:59,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 54 [2018-11-07 16:35:59,539 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:59,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:35:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:35:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2553, Unknown=1, NotChecked=0, Total=2862 [2018-11-07 16:35:59,542 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand 38 states. [2018-11-07 16:36:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:03,579 INFO L93 Difference]: Finished difference Result 395 states and 442 transitions. [2018-11-07 16:36:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 16:36:03,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59 [2018-11-07 16:36:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:03,581 INFO L225 Difference]: With dead ends: 395 [2018-11-07 16:36:03,582 INFO L226 Difference]: Without dead ends: 304 [2018-11-07 16:36:03,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1282, Invalid=8419, Unknown=1, NotChecked=0, Total=9702 [2018-11-07 16:36:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-07 16:36:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 162. [2018-11-07 16:36:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 16:36:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 16:36:03,607 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 59 [2018-11-07 16:36:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:03,608 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 16:36:03,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:36:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 16:36:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 16:36:03,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:03,609 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:03,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:03,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1912545771, now seen corresponding path program 1 times [2018-11-07 16:36:03,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:03,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:03,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:04,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:04,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 16:36:04,124 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [63], [65], [73], [76], [78], [81], [83], [84], [85], [86], [88], [89] [2018-11-07 16:36:04,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:36:04,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:36:04,131 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:36:04,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:36:04,267 INFO L272 AbstractInterpreter]: Visited 39 different actions 267 times. Merged at 25 different actions 162 times. Widened at 5 different actions 9 times. Found 15 fixpoints after 6 different actions. Largest state had 26 variables. [2018-11-07 16:36:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:04,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:36:04,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:04,311 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:36:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:04,323 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:36:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:04,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:04,639 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 41 treesize of output 34 [2018-11-07 16:36:04,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:04,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:36:04,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:04,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:04,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:04,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:36:04,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:04,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-07 16:36:04,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:04,837 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:04,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:04,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-07 16:36:04,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:04,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:04,863 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-11-07 16:36:04,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-07 16:36:05,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 32 treesize of output 24 [2018-11-07 16:36:05,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:05,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:05,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:05,265 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-07 16:36:05,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:05,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:05,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:05,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-07 16:36:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:05,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:10,418 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 74 treesize of output 66 [2018-11-07 16:36:10,420 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-11-07 16:36:10,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,496 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,496 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,498 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,499 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,503 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 16:36:10,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,514 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-07 16:36:10,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,519 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,520 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-11-07 16:36:10,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,532 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-11-07 16:36:10,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,546 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,546 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,547 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,552 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,553 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-11-07 16:36:10,557 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,578 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:36:10,580 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:10,583 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,586 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,588 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,589 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:10,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-11-07 16:36:10,593 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:10,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:36:10,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:36:10,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:36:10,675 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-11-07 16:36:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 20] total 57 [2018-11-07 16:36:12,955 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:12,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:36:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:36:12,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2911, Unknown=2, NotChecked=0, Total=3192 [2018-11-07 16:36:12,958 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 16:36:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:14,631 INFO L93 Difference]: Finished difference Result 240 states and 260 transitions. [2018-11-07 16:36:14,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 16:36:14,632 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2018-11-07 16:36:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:14,634 INFO L225 Difference]: With dead ends: 240 [2018-11-07 16:36:14,634 INFO L226 Difference]: Without dead ends: 238 [2018-11-07 16:36:14,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=542, Invalid=5156, Unknown=2, NotChecked=0, Total=5700 [2018-11-07 16:36:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-07 16:36:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2018-11-07 16:36:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 16:36:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 16:36:14,658 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 63 [2018-11-07 16:36:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:14,658 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 16:36:14,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:36:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 16:36:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 16:36:14,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:14,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-07 16:36:14,659 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:14,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2132240345, now seen corresponding path program 5 times [2018-11-07 16:36:14,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:14,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:14,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:14,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:14,955 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 16:36:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:16,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:16,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:16,190 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:16,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:16,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:16,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:16,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:16,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:36:16,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:16,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:16,450 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 41 treesize of output 34 [2018-11-07 16:36:16,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:16,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 74 [2018-11-07 16:36:16,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 16:36:16,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-07 16:36:16,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,705 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:16,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-07 16:36:16,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-07 16:36:16,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:16,849 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 41 treesize of output 47 [2018-11-07 16:36:16,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:16,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:16,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 84 [2018-11-07 16:36:16,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:16,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:35 [2018-11-07 16:36:16,999 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 34 treesize of output 27 [2018-11-07 16:36:17,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:17,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:17,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:17,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-07 16:36:17,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-07 16:36:17,095 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 28 treesize of output 20 [2018-11-07 16:36:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:17,098 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 20 treesize of output 16 [2018-11-07 16:36:17,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:17,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-07 16:36:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:17,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:19,315 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:36:21,423 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 16:36:46,450 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 88 treesize of output 80 [2018-11-07 16:36:46,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 87 [2018-11-07 16:36:46,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,471 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 16:36:46,751 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 16:36:46,756 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,757 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,767 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2018-11-07 16:36:46,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:46,770 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,774 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,774 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,781 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 94 [2018-11-07 16:36:46,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:46,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 16:36:46,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:46,813 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:36:46,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:46,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 96 [2018-11-07 16:36:46,835 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:46,838 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,838 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,841 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,848 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 94 [2018-11-07 16:36:46,857 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:46,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,872 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:46,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 95 [2018-11-07 16:36:46,881 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:47,112 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,114 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,115 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,123 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,123 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 16:36:47,133 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:47,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,143 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,143 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,144 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,145 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 127 [2018-11-07 16:36:47,168 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 16:36:47,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,321 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,329 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,343 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 2 case distinctions, treesize of input 44 treesize of output 86 [2018-11-07 16:36:47,345 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 16:36:47,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,354 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:36:47,367 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2018-11-07 16:36:47,368 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-11-07 16:36:47,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 16:36:47,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:36:47,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:36:47,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:36:47,587 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:104, output treesize:50 [2018-11-07 16:36:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-11-07 16:36:51,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:51,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 65 [2018-11-07 16:36:51,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:51,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:36:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:36:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3550, Unknown=14, NotChecked=124, Total=4160 [2018-11-07 16:36:51,561 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 16:36:54,901 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-07 16:36:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:55,116 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-11-07 16:36:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:36:55,117 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-11-07 16:36:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:55,120 INFO L225 Difference]: With dead ends: 282 [2018-11-07 16:36:55,120 INFO L226 Difference]: Without dead ends: 280 [2018-11-07 16:36:55,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=1333, Invalid=8163, Unknown=14, NotChecked=192, Total=9702 [2018-11-07 16:36:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-07 16:36:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 187. [2018-11-07 16:36:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 16:36:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 16:36:55,151 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 62 [2018-11-07 16:36:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:55,151 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 16:36:55,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:36:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 16:36:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:36:55,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:55,153 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:55,153 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:55,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1372551317, now seen corresponding path program 3 times [2018-11-07 16:36:55,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:55,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:55,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:36:55,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:55,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:55,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:55,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:55,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:55,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:36:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:36:55,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:36:55,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:36:55,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:55,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:36:56,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:36:56,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:56,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 16:36:56,335 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:56,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:36:56,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:36:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:36:56,336 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 16:36:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:56,648 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-11-07 16:36:56,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:36:56,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-07 16:36:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:56,650 INFO L225 Difference]: With dead ends: 306 [2018-11-07 16:36:56,650 INFO L226 Difference]: Without dead ends: 272 [2018-11-07 16:36:56,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:36:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-07 16:36:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 199. [2018-11-07 16:36:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 16:36:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 218 transitions. [2018-11-07 16:36:56,682 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 218 transitions. Word has length 65 [2018-11-07 16:36:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:56,682 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 218 transitions. [2018-11-07 16:36:56,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:36:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 218 transitions. [2018-11-07 16:36:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 16:36:56,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:56,684 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-07 16:36:56,684 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:56,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2042156006, now seen corresponding path program 2 times [2018-11-07 16:36:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:56,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:56,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:57,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:57,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:57,696 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:57,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:57,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:57,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:36:57,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:57,709 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:57,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 16:36:57,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:57,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:57,837 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 28 treesize of output 23 [2018-11-07 16:36:57,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:57,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 37 [2018-11-07 16:36:57,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:57,858 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-11-07 16:36:57,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-11-07 16:36:57,970 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 30 treesize of output 23 [2018-11-07 16:36:57,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:57,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 16:36:57,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:57,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:57,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:57,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2018-11-07 16:36:58,057 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 30 treesize of output 23 [2018-11-07 16:36:58,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 16:36:58,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-07 16:36:58,168 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 30 treesize of output 23 [2018-11-07 16:36:58,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:36:58,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 16:36:58,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-11-07 16:36:58,264 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 26 treesize of output 18 [2018-11-07 16:36:58,289 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:36:58,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:36:58,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:36:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:58,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:00,434 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:37:02,490 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 16:37:04,583 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 16:37:06,686 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_48 Int) (main_~key~0 Int)) (or (< v_main_~i~0_48 1) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 v_main_~i~0_48)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))) (< v_main_~i~0_48 c_main_~j~0))) is different from false [2018-11-07 16:37:22,047 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 73 treesize of output 67 [2018-11-07 16:37:22,073 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74 [2018-11-07 16:37:22,123 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 102 [2018-11-07 16:37:22,431 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2018-11-07 16:37:22,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,464 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 96 [2018-11-07 16:37:22,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-11-07 16:37:22,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,498 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 96 [2018-11-07 16:37:22,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 6 xjuncts. [2018-11-07 16:37:22,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,538 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 96 [2018-11-07 16:37:22,542 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-11-07 16:37:22,549 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,551 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,553 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,554 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,578 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 97 [2018-11-07 16:37:22,582 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 7 xjuncts. [2018-11-07 16:37:22,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,726 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-11-07 16:37:22,742 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 60 [2018-11-07 16:37:22,743 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:37:22,745 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:37:22,745 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:22,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:22,777 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 96 [2018-11-07 16:37:22,779 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-11-07 16:37:23,062 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,097 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 95 [2018-11-07 16:37:23,101 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 16 xjuncts. [2018-11-07 16:37:23,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 136 [2018-11-07 16:37:23,182 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 27 xjuncts. [2018-11-07 16:37:23,481 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,486 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 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-07 16:37:23,487 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:23,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:23,506 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 49 treesize of output 83 [2018-11-07 16:37:23,507 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 16:37:23,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:37:23,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:37:23,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:37:23,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:37:23,700 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:87, output treesize:40 [2018-11-07 16:37:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 40 refuted. 3 times theorem prover too weak. 0 trivial. 13 not checked. [2018-11-07 16:37:23,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:23,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 26] total 54 [2018-11-07 16:37:23,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:23,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:37:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:37:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2330, Unknown=8, NotChecked=202, Total=2862 [2018-11-07 16:37:23,857 INFO L87 Difference]: Start difference. First operand 199 states and 218 transitions. Second operand 31 states. [2018-11-07 16:37:26,780 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-07 16:37:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:27,232 INFO L93 Difference]: Finished difference Result 373 states and 414 transitions. [2018-11-07 16:37:27,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:37:27,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-07 16:37:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:27,235 INFO L225 Difference]: With dead ends: 373 [2018-11-07 16:37:27,235 INFO L226 Difference]: Without dead ends: 371 [2018-11-07 16:37:27,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 89 SyntacticMatches, 13 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=1031, Invalid=5289, Unknown=8, NotChecked=314, Total=6642 [2018-11-07 16:37:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-07 16:37:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 218. [2018-11-07 16:37:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 16:37:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-11-07 16:37:27,284 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 64 [2018-11-07 16:37:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:27,284 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-11-07 16:37:27,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:37:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-11-07 16:37:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 16:37:27,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:27,304 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-07 16:37:27,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:27,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1818764072, now seen corresponding path program 3 times [2018-11-07 16:37:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:27,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:37:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:27,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:28,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:28,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:28,158 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:28,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:28,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:28,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:37:28,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:37:28,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:37:28,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:37:28,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:37:28,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:28,480 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 28 treesize of output 23 [2018-11-07 16:37:28,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:37:28,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,502 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-11-07 16:37:28,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-11-07 16:37:28,680 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 37 treesize of output 30 [2018-11-07 16:37:28,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-11-07 16:37:28,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:37:28,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2018-11-07 16:37:28,914 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 37 treesize of output 29 [2018-11-07 16:37:28,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:28,918 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:28,919 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:28,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-07 16:37:28,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:28,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-11-07 16:37:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:28,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:41,589 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 59 treesize of output 53 [2018-11-07 16:37:41,591 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-07 16:37:41,660 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,663 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,665 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,665 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-07 16:37:41,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-07 16:37:41,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,744 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-07 16:37:41,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 86 [2018-11-07 16:37:41,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,777 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,793 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-07 16:37:41,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,797 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,798 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,798 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,800 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,801 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,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, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-07 16:37:41,823 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,824 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:37:41,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 16:37:41,850 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:37:41,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-07 16:37:41,994 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:38 [2018-11-07 16:37:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:42,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:42,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2018-11-07 16:37:42,230 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:42,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:37:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:37:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2287, Unknown=6, NotChecked=0, Total=2550 [2018-11-07 16:37:42,232 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 34 states. [2018-11-07 16:37:44,827 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2018-11-07 16:37:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:45,559 INFO L93 Difference]: Finished difference Result 302 states and 332 transitions. [2018-11-07 16:37:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:37:45,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-11-07 16:37:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:45,561 INFO L225 Difference]: With dead ends: 302 [2018-11-07 16:37:45,562 INFO L226 Difference]: Without dead ends: 300 [2018-11-07 16:37:45,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=713, Invalid=4831, Unknown=6, NotChecked=0, Total=5550 [2018-11-07 16:37:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-07 16:37:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 214. [2018-11-07 16:37:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 16:37:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2018-11-07 16:37:45,601 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 64 [2018-11-07 16:37:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-11-07 16:37:45,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:37:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2018-11-07 16:37:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 16:37:45,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:45,603 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-11-07 16:37:45,603 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:45,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1292852080, now seen corresponding path program 4 times [2018-11-07 16:37:45,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:45,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:37:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:45,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:46,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:46,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:46,205 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:46,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:46,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:46,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 16:37:46,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:37:46,214 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:37:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:46,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:46,475 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 28 treesize of output 23 [2018-11-07 16:37:46,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:46,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:37:46,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 16:37:46,593 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 32 treesize of output 25 [2018-11-07 16:37:46,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:46,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:46,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:37:46,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 16:37:46,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 16:37:46,889 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 26 treesize of output 18 [2018-11-07 16:37:46,893 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:37:46,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:37:46,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:37:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:46,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:55,932 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 16:38:13,943 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 30 Received shutdown request... [2018-11-07 16:38:19,975 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 16:38:20,176 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:20,177 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:38:20,182 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:38:20,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:38:20 BoogieIcfgContainer [2018-11-07 16:38:20,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:38:20,183 INFO L168 Benchmark]: Toolchain (without parser) took 265336.77 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.5 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -980.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:20,184 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:38:20,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.45 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-11-07 16:38:20,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.79 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-11-07 16:38:20,185 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 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-11-07 16:38:20,185 INFO L168 Benchmark]: RCFGBuilder took 636.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -746.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:20,185 INFO L168 Benchmark]: TraceAbstraction took 264291.72 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 286.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -245.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:20,187 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.45 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 29.79 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 39.89 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 636.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -746.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264291.72 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 286.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -245.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. TIMEOUT Result, 264.2s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 44.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 777 SDtfs, 3600 SDslu, 6477 SDs, 0 SdLazy, 10691 SolverSat, 1235 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 27.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2161 GetRequests, 1186 SyntacticMatches, 108 SemanticMatches, 867 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 19488 ImplicationChecksByTransitivity, 183.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 181.1s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2352 ConstructedInterpolants, 260 QuantifiedInterpolants, 1757506 SizeOfPredicates, 214 NumberOfNonLiveVariables, 1564 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 225/1319 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown