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-EXP.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:26:55,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:26:55,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:26:55,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:26:55,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:26:55,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:26:55,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:26:55,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:26:55,853 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:26:55,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:26:55,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:26:55,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:26:55,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:26:55,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:26:55,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:26:55,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:26:55,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:26:55,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:26:55,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:26:55,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:26:55,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:26:55,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:26:55,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:26:55,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:26:55,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:26:55,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:26:55,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:26:55,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:26:55,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:26:55,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:26:55,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:26:55,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:26:55,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:26:55,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:26:55,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:26:55,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:26:55,891 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:26:55,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:26:55,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:26:55,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:26:55,924 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:26:55,927 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:26:55,928 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:26:55,928 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:26:55,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:26:55,928 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:26:55,929 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:26:55,929 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:26:55,929 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:26:55,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:26:55,929 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:26:55,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:26:55,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:26:55,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:26:55,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:26:55,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:26:55,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:26:55,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:26:55,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:26:55,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:26:55,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:26:55,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:26:55,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:26:55,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:26:55,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:26:55,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:26:55,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:26:55,936 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:26:55,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:26:55,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:26:55,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:26:55,936 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:26:55,937 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:26:55,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:26:56,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:26:56,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:26:56,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:26:56,022 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:26:56,023 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 10:26:56,091 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516a5d1b/7efe21fcfd37443781adb0dab4a2dd29/FLAGeb1343761 [2018-11-07 10:26:56,594 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:26:56,594 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-07 10:26:56,600 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516a5d1b/7efe21fcfd37443781adb0dab4a2dd29/FLAGeb1343761 [2018-11-07 10:26:56,614 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c516a5d1b/7efe21fcfd37443781adb0dab4a2dd29 [2018-11-07 10:26:56,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:26:56,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:26:56,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:56,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:26:56,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:26:56,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da72689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56, skipping insertion in model container [2018-11-07 10:26:56,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:26:56,667 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:26:56,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:56,889 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:26:56,924 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:56,948 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:26:56,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56 WrapperNode [2018-11-07 10:26:56,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:56,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:56,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:26:56,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:26:56,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:56,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:26:56,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:26:56,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:26:56,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:56,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:57,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:57,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:57,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (1/1) ... [2018-11-07 10:26:57,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:26:57,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:26:57,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:26:57,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:26:57,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (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 10:26:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:26:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:26:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:26:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:26:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:26:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:26:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:26:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:26:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:26:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:26:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:26:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:26:57,674 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:26:57,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:57 BoogieIcfgContainer [2018-11-07 10:26:57,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:26:57,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:26:57,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:26:57,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:26:57,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:26:56" (1/3) ... [2018-11-07 10:26:57,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42592a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:57, skipping insertion in model container [2018-11-07 10:26:57,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:56" (2/3) ... [2018-11-07 10:26:57,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42592a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:57, skipping insertion in model container [2018-11-07 10:26:57,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:57" (3/3) ... [2018-11-07 10:26:57,684 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-07 10:26:57,694 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:26:57,703 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:26:57,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:26:57,754 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:26:57,754 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:26:57,754 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:26:57,754 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:26:57,754 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:26:57,755 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:26:57,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:26:57,755 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:26:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 10:26:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 10:26:57,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:57,783 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 10:26:57,785 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:57,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 369743628, now seen corresponding path program 1 times [2018-11-07 10:26:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:57,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:57,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:57,939 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 10:26:57,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:57,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:26:57,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:26:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:26:57,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:26:57,962 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-07 10:26:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:57,989 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-07 10:26:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:26:57,991 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 10:26:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:58,001 INFO L225 Difference]: With dead ends: 80 [2018-11-07 10:26:58,001 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:26:58,005 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 10:26:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:26:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 10:26:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:26:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 10:26:58,047 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-11-07 10:26:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:58,048 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 10:26:58,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:26:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 10:26:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:26:58,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:58,050 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 10:26:58,050 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:58,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash 994502583, now seen corresponding path program 1 times [2018-11-07 10:26:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:58,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:58,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:58,274 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 10:26:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:26:58,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:58,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:26:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:26:58,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:58,278 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-11-07 10:26:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:58,489 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-07 10:26:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:26:58,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 10:26:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:58,493 INFO L225 Difference]: With dead ends: 68 [2018-11-07 10:26:58,493 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:26:58,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:26:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:26:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-07 10:26:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 10:26:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 10:26:58,506 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2018-11-07 10:26:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:58,510 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 10:26:58,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:26:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 10:26:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:26:58,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:58,511 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 10:26:58,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:58,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 385502281, now seen corresponding path program 1 times [2018-11-07 10:26:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:58,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:58,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:58,858 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 10:26:58,869 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 10:26:58,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:58,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:26:58,870 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:58,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:26:58,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:26:58,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:58,871 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-11-07 10:26:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:59,009 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-07 10:26:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:26:59,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 10:26:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:59,012 INFO L225 Difference]: With dead ends: 92 [2018-11-07 10:26:59,012 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 10:26:59,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:26:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 10:26:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-11-07 10:26:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 10:26:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-07 10:26:59,023 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2018-11-07 10:26:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:59,023 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-07 10:26:59,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:26:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-07 10:26:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:26:59,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:59,025 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 10:26:59,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:59,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1987166342, now seen corresponding path program 1 times [2018-11-07 10:26:59,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:59,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:59,490 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 10:27:00,196 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-07 10:27:00,473 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 10:27:00,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:00,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:00,475 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 10:27:00,477 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 10:27:00,517 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:00,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:27:00,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:27:00,807 INFO L272 AbstractInterpreter]: Visited 30 different actions 96 times. Merged at 18 different actions 54 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 10:27:00,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:00,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:27:00,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:00,829 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 10:27:00,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:00,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:00,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:01,389 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 10:27:01,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:01,402 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 10:27:01,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:01,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:01,457 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 10:27:01,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 10:27:01,590 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 10:27:01,630 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 10:27:01,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:01,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:01,679 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 10:27:01,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:27:01,723 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 10:27:01,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:04,119 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 10:27:04,205 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,207 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 10:27:04,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:04,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,233 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 10:27:04,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:04,240 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:04,254 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 10:27:04,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:04,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:27:04,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:04,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 10:27:04,512 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 10:27:04,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2018-11-07 10:27:04,543 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:04,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:27:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:27:04,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1071, Unknown=1, NotChecked=0, Total=1260 [2018-11-07 10:27:04,546 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 24 states. [2018-11-07 10:27:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:05,683 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-07 10:27:05,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:27:05,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-07 10:27:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:05,688 INFO L225 Difference]: With dead ends: 104 [2018-11-07 10:27:05,688 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 10:27:05,690 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 10:27:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 10:27:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2018-11-07 10:27:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:27:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-07 10:27:05,705 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 31 [2018-11-07 10:27:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:05,706 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-07 10:27:05,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:27:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-07 10:27:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 10:27:05,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:05,708 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 10:27:05,708 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:05,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -456310597, now seen corresponding path program 1 times [2018-11-07 10:27:05,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:05,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:06,529 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 10:27:06,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:06,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:06,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-07 10:27:06,530 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 10:27:06,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:06,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:27:06,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:27:06,698 INFO L272 AbstractInterpreter]: Visited 35 different actions 117 times. Merged at 23 different actions 62 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 25 variables. [2018-11-07 10:27:06,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:06,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:27:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:06,713 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 10:27:06,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:06,725 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:06,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:06,997 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 10:27:07,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,038 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 10:27:07,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:07,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:07,071 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 10:27:07,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 10:27:07,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,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, 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 10:27:07,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:07,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,495 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 10:27:07,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:07,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:07,519 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 10:27:07,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 10:27:07,965 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 10:27:07,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:07,976 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:07,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:08,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:08,002 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 10:27:08,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:08,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:08,052 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 10:27:08,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 10:27:08,103 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 10:27:08,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:14,799 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 10:27:14,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:14,850 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 10:27:15,007 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-07 10:27:15,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,064 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 10:27:15,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:15,068 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:27:15,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:15,075 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,079 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,079 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,080 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,080 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,091 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 10:27:15,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:15,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,143 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,172 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 10:27:15,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:15,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,180 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,182 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 10:27:15,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:15,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,188 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,188 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,191 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,194 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,195 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,205 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 10:27:15,209 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:15,236 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,237 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,238 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,238 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,245 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:15,255 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 10:27:15,258 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:15,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:15,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:15,310 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 10:27:15,311 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 10:27:19,408 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 10:27:19,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:19,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 50 [2018-11-07 10:27:19,432 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:19,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:27:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:27:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2168, Unknown=3, NotChecked=0, Total=2450 [2018-11-07 10:27:19,434 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 35 states. [2018-11-07 10:27:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:21,498 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2018-11-07 10:27:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:27:21,498 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-11-07 10:27:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:21,503 INFO L225 Difference]: With dead ends: 204 [2018-11-07 10:27:21,503 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 10:27:21,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=612, Invalid=4215, Unknown=3, NotChecked=0, Total=4830 [2018-11-07 10:27:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 10:27:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 78. [2018-11-07 10:27:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:27:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-07 10:27:21,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 38 [2018-11-07 10:27:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:21,520 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-07 10:27:21,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:27:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-07 10:27:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:27:21,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:21,522 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 10:27:21,523 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:21,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1097051736, now seen corresponding path program 1 times [2018-11-07 10:27:21,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:21,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:21,598 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 10:27:21,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:21,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:21,599 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 10:27:21,599 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 10:27:21,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:21,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:27:21,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:27:21,680 INFO L272 AbstractInterpreter]: Visited 31 different actions 101 times. Merged at 19 different actions 55 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 10:27:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:21,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:27:21,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:21,710 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 10:27:21,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:21,725 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:21,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:21,760 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 10:27:21,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:21,874 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 10:27:21,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2018-11-07 10:27:21,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:21,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:27:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:27:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:27:21,907 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 8 states. [2018-11-07 10:27:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:22,184 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2018-11-07 10:27:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:27:22,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 10:27:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:22,187 INFO L225 Difference]: With dead ends: 170 [2018-11-07 10:27:22,187 INFO L226 Difference]: Without dead ends: 110 [2018-11-07 10:27:22,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:27:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-07 10:27:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2018-11-07 10:27:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 10:27:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-07 10:27:22,199 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 41 [2018-11-07 10:27:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:22,199 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-07 10:27:22,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:27:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-07 10:27:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 10:27:22,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:22,201 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 10:27:22,201 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:22,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash -429526962, now seen corresponding path program 1 times [2018-11-07 10:27:22,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:22,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:22,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:22,483 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 10:27:22,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:22,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:22,484 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-07 10:27:22,484 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 10:27:22,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:22,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:27:22,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:27:22,597 INFO L272 AbstractInterpreter]: Visited 35 different actions 142 times. Merged at 21 different actions 74 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 25 variables. [2018-11-07 10:27:22,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:22,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:27:22,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:22,609 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 10:27:22,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:22,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:22,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:22,731 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 10:27:22,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:22,955 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 10:27:22,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:22,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-11-07 10:27:22,976 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:22,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:27:22,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:27:22,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:27:22,977 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2018-11-07 10:27:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:23,189 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-11-07 10:27:23,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:27:23,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-07 10:27:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:23,191 INFO L225 Difference]: With dead ends: 150 [2018-11-07 10:27:23,191 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 10:27:23,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:27:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 10:27:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2018-11-07 10:27:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 10:27:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-07 10:27:23,204 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2018-11-07 10:27:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:23,204 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-07 10:27:23,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:27:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-07 10:27:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 10:27:23,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:23,206 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 10:27:23,206 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:23,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1408574763, now seen corresponding path program 2 times [2018-11-07 10:27:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:23,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:23,590 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2018-11-07 10:27:24,226 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 10:27:24,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:24,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:24,227 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:24,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:24,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:24,227 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 10:27:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:24,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:24,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:27:24,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:24,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:24,769 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 10:27:24,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:24,775 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 10:27:24,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:24,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:24,792 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 10:27:24,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 10:27:24,925 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 10:27:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:24,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:24,937 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 10:27:24,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:24,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:24,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:24,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-11-07 10:27:25,007 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 10:27:25,010 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 10:27:25,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:25,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:25,014 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 10:27:25,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:27:25,032 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 10:27:25,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:25,681 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 10:27:25,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,712 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,721 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 10:27:25,791 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,797 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,819 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 10:27:25,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 10:27:25,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:25,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:25,877 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 10:27:26,180 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2018-11-07 10:27:26,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,233 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,279 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,288 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,289 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-07 10:27:26,297 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 10:27:26,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:26,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,304 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,307 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,330 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 10:27:26,334 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 10:27:26,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,341 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,345 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,365 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 10:27:26,369 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 10:27:26,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,377 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,379 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,383 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,384 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,393 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 10:27:26,396 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:26,470 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 10:27:26,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,477 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 10:27:26,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,536 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,536 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,537 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:26,556 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 10:27:26,557 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 10:27:26,580 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:26,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:26,602 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 10:27:26,602 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:96, output treesize:14 [2018-11-07 10:27:26,737 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 10:27:26,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:26,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 45 [2018-11-07 10:27:26,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:26,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:27:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:27:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:27:26,759 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 27 states. [2018-11-07 10:27:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:28,048 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2018-11-07 10:27:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:27:28,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-07 10:27:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:28,051 INFO L225 Difference]: With dead ends: 188 [2018-11-07 10:27:28,051 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 10:27:28,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=585, Invalid=3075, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:27:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 10:27:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2018-11-07 10:27:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 10:27:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-11-07 10:27:28,068 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 43 [2018-11-07 10:27:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:28,068 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-11-07 10:27:28,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:27:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-07 10:27:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 10:27:28,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:28,070 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 10:27:28,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:28,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:28,071 INFO L82 PathProgramCache]: Analyzing trace with hash -836780148, now seen corresponding path program 2 times [2018-11-07 10:27:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:28,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:28,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:28,168 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 10:27:28,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:28,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:28,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:28,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:28,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:28,169 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 10:27:28,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:28,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:28,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:27:28,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:28,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:28,222 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 10:27:28,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:28,266 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 10:27:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2018-11-07 10:27:28,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:28,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:27:28,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:27:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:27:28,288 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 9 states. [2018-11-07 10:27:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:28,563 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2018-11-07 10:27:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:27:28,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-07 10:27:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:28,566 INFO L225 Difference]: With dead ends: 222 [2018-11-07 10:27:28,566 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 10:27:28,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:27:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 10:27:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-11-07 10:27:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 10:27:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-11-07 10:27:28,580 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 50 [2018-11-07 10:27:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:28,581 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-11-07 10:27:28,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:27:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-11-07 10:27:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 10:27:28,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:28,582 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 10:27:28,583 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:28,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1313256330, now seen corresponding path program 3 times [2018-11-07 10:27:28,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:28,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:28,894 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 10:27:29,379 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-07 10:27:30,259 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 10:27:30,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:30,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:30,259 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:30,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:30,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:30,260 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 10:27:30,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:27:30,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:27:30,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:27:30,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:30,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:30,530 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 10:27:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:30,536 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 10:27:30,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:30,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:30,558 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 10:27:30,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 10:27:30,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:30,799 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 10:27:30,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:30,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:30,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:30,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:30,810 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 10:27:30,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:30,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:30,861 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 10:27:30,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:38 [2018-11-07 10:27:31,126 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 10:27:31,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,137 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 10:27:31,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:31,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:31,164 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 10:27:31,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:35 [2018-11-07 10:27:31,933 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 10:27:31,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,936 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:31,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,938 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:27:31,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:27:31,942 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 10:27:31,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:27:31,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:27:31,955 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 10:27:31,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 10:27:32,008 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 10:27:32,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:34,187 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 10:27:36,218 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 10:28:00,738 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 10:28:04,895 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 10:28:14,029 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 10:28:14,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,041 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 10:28:14,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,075 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 10:28:14,362 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 10:28:14,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,431 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,454 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,475 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,499 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,570 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,579 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,592 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,658 INFO L303 Elim1Store]: Index analysis took 292 ms [2018-11-07 10:28:14,665 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 10:28:14,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:14,673 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,679 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,679 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,723 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 10:28:14,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:14,748 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,764 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,764 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,787 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 10:28:14,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:14,803 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,833 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,873 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,897 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,985 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:14,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,123 INFO L303 Elim1Store]: Index analysis took 334 ms [2018-11-07 10:28:15,205 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 10:28:15,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:15,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,273 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,286 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,331 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,355 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,411 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,537 INFO L303 Elim1Store]: Index analysis took 329 ms [2018-11-07 10:28:15,608 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 10:28:15,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:15,663 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,758 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,821 INFO L303 Elim1Store]: Index analysis took 210 ms [2018-11-07 10:28:15,884 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 10:28:15,886 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:15,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,922 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:15,989 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,007 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,079 INFO L303 Elim1Store]: Index analysis took 192 ms [2018-11-07 10:28:16,080 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 10:28:16,081 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:16,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,454 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,460 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,479 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 10:28:16,482 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-07 10:28:16,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,578 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,603 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-07 10:28:16,680 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 10:28:16,681 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:16,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,780 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:16,807 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-07 10:28:16,980 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 10:28:16,982 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 10:28:18,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,075 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 10:28:18,078 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:18,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,121 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 10:28:18,122 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:18,126 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,130 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:18,150 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 10:28:18,152 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:18,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-07 10:28:18,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 10:28:18,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 10:28:18,468 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 10:28:18,468 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:96, output treesize:63 [2018-11-07 10:28:28,915 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 10:28:28,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:28,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 22] total 63 [2018-11-07 10:28:28,941 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:28,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:28:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:28:28,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3242, Unknown=22, NotChecked=238, Total=3906 [2018-11-07 10:28:28,944 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 44 states. [2018-11-07 10:28:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:32,344 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-11-07 10:28:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:28:32,345 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2018-11-07 10:28:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:32,347 INFO L225 Difference]: With dead ends: 173 [2018-11-07 10:28:32,347 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 10:28:32,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=813, Invalid=5653, Unknown=22, NotChecked=318, Total=6806 [2018-11-07 10:28:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 10:28:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 125. [2018-11-07 10:28:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 10:28:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-11-07 10:28:32,363 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 50 [2018-11-07 10:28:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:32,363 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-11-07 10:28:32,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:28:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-11-07 10:28:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 10:28:32,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:32,365 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 10:28:32,365 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:32,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -100176119, now seen corresponding path program 1 times [2018-11-07 10:28:32,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:32,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:32,366 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:32,818 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 10:28:32,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:32,818 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:32,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 10:28:32,819 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 10:28:32,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:28:32,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:28:32,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:28:32,874 INFO L272 AbstractInterpreter]: Visited 34 different actions 91 times. Merged at 22 different actions 47 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 25 variables. [2018-11-07 10:28:32,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:32,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:28:32,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:32,914 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 10:28:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:32,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:32,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:33,133 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 10:28:33,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:33,137 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 10:28:33,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:33,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:33,154 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 10:28:33,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-07 10:28:33,209 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 10:28:33,218 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 10:28:33,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:33,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:33,221 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 10:28:33,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:28:33,236 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 10:28:33,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:33,381 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 10:28:33,429 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,431 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 10:28:33,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:33,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,447 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 10:28:33,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:33,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,451 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:33,461 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 10:28:33,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:33,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:28:33,492 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 10:28:33,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 10:28:33,669 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 10:28:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:33,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 34 [2018-11-07 10:28:33,695 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:33,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:28:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:28:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:28:33,696 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 20 states. [2018-11-07 10:28:34,860 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:28:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:35,707 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2018-11-07 10:28:35,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:28:35,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-11-07 10:28:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:35,710 INFO L225 Difference]: With dead ends: 288 [2018-11-07 10:28:35,710 INFO L226 Difference]: Without dead ends: 286 [2018-11-07 10:28:35,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=656, Invalid=3504, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 10:28:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-07 10:28:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 158. [2018-11-07 10:28:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-07 10:28:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-11-07 10:28:35,729 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 52 [2018-11-07 10:28:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:35,729 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-11-07 10:28:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:28:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-11-07 10:28:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 10:28:35,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:35,733 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 10:28:35,733 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:35,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -775250273, now seen corresponding path program 2 times [2018-11-07 10:28:35,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:35,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:35,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:36,086 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-07 10:28:36,497 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-11-07 10:28:36,917 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-07 10:28:37,210 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 10:28:37,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:37,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:37,211 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:37,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:37,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:37,211 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 10:28:37,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:28:37,221 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:37,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:28:37,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:37,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:37,425 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 10:28:37,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:37,441 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 10:28:37,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:37,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:37,456 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 10:28:37,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-07 10:28:37,761 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 10:28:37,765 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 10:28:37,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:37,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:37,767 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 10:28:37,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:28:37,821 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 10:28:37,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:38,031 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 10:28:38,076 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,079 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,088 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 10:28:38,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:38,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,094 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 10:28:38,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:38,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:38,114 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 10:28:38,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:28:38,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:38,131 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 10:28:38,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 10:28:38,450 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 10:28:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:38,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 39 [2018-11-07 10:28:38,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:38,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:28:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:28:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:28:38,472 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 34 states. [2018-11-07 10:28:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:55,599 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-11-07 10:28:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:28:55,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-07 10:28:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:55,601 INFO L225 Difference]: With dead ends: 235 [2018-11-07 10:28:55,601 INFO L226 Difference]: Without dead ends: 233 [2018-11-07 10:28:55,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=417, Invalid=3243, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:28:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-07 10:28:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 178. [2018-11-07 10:28:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-07 10:28:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-11-07 10:28:55,620 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 54 [2018-11-07 10:28:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:55,620 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-11-07 10:28:55,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:28:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2018-11-07 10:28:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:28:55,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:55,622 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 10:28:55,622 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:55,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1414645976, now seen corresponding path program 4 times [2018-11-07 10:28:55,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:55,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:55,624 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:56,743 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 10:28:56,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:56,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:56,744 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:56,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:56,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:56,744 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 10:28:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:56,753 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:56,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:57,001 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 10:28:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,005 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 10:28:57,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:57,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:57,025 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 10:28:57,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 10:28:57,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,180 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 10:28:57,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:57,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,189 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 10:28:57,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:57,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:57,214 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 10:28:57,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:35 [2018-11-07 10:28:57,981 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 10:28:57,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:57,987 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:28:57,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:28:57,990 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 10:28:57,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:28:57,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:28:58,025 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 10:28:58,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 10:28:58,051 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 10:28:58,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:01,539 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 10:29:01,550 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,556 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 10:29:01,650 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:29:01,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:01,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,692 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,704 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 10:29:01,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:01,707 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:29:01,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:01,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,712 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,794 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 10:29:01,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:01,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,800 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,800 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,801 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,803 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,804 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 10:29:01,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:01,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,813 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,824 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 10:29:01,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:01,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,830 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,830 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,830 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,833 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:01,846 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 10:29:01,848 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:01,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:01,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:01,894 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 10:29:01,894 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 10:29:03,995 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 10:29:04,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:04,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 54 [2018-11-07 10:29:04,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:04,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:29:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:29:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2552, Unknown=1, NotChecked=0, Total=2862 [2018-11-07 10:29:04,017 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand 38 states. [2018-11-07 10:29:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:07,812 INFO L93 Difference]: Finished difference Result 395 states and 442 transitions. [2018-11-07 10:29:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 10:29:07,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59 [2018-11-07 10:29:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:07,814 INFO L225 Difference]: With dead ends: 395 [2018-11-07 10:29:07,814 INFO L226 Difference]: Without dead ends: 304 [2018-11-07 10:29:07,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1283, Invalid=8418, Unknown=1, NotChecked=0, Total=9702 [2018-11-07 10:29:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-07 10:29:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 162. [2018-11-07 10:29:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 10:29:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 10:29:07,840 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 59 [2018-11-07 10:29:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:07,840 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 10:29:07,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:29:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 10:29:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 10:29:07,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:07,842 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 10:29:07,842 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:07,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1912545771, now seen corresponding path program 1 times [2018-11-07 10:29:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:07,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:07,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:08,429 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 10:29:08,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:08,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:08,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 10:29:08,430 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 10:29:08,432 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:29:08,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:29:08,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:29:08,507 INFO L272 AbstractInterpreter]: Visited 39 different actions 145 times. Merged at 25 different actions 72 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-07 10:29:08,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:08,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:29:08,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:08,521 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 10:29:08,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:08,529 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:08,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:08,783 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 10:29:08,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:08,788 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 10:29:08,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:08,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:08,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:08,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 10:29:08,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:08,969 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 10:29:08,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:08,972 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:08,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:08,977 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 10:29:08,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:08,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:08,997 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 10:29:08,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-07 10:29:09,389 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 10:29:09,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:09,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:09,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:09,394 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 10:29:09,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:09,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:09,405 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 10:29:09,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-07 10:29:09,505 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 10:29:09,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:16,678 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 10:29:16,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,729 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 10:29:16,847 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-07 10:29:16,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,867 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 10:29:16,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:16,876 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,885 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 10:29:16,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:16,891 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,891 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,896 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 10:29:16,897 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:16,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,907 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,916 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 10:29:16,916 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:16,921 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,922 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,937 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 10:29:16,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:16,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,945 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,969 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 10:29:16,971 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:16,976 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,979 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,979 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,985 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,985 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:16,993 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 10:29:16,995 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:17,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:17,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:17,094 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 10:29:17,095 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-11-07 10:29:19,223 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 10:29:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 20] total 57 [2018-11-07 10:29:19,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:19,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:29:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:29:19,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2909, Unknown=4, NotChecked=0, Total=3192 [2018-11-07 10:29:19,246 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 10:29:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:20,992 INFO L93 Difference]: Finished difference Result 240 states and 260 transitions. [2018-11-07 10:29:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:29:20,992 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2018-11-07 10:29:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:20,994 INFO L225 Difference]: With dead ends: 240 [2018-11-07 10:29:20,995 INFO L226 Difference]: Without dead ends: 238 [2018-11-07 10:29:20,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=542, Invalid=5154, Unknown=4, NotChecked=0, Total=5700 [2018-11-07 10:29:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-07 10:29:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2018-11-07 10:29:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 10:29:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 10:29:21,018 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 63 [2018-11-07 10:29:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:21,018 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 10:29:21,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:29:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 10:29:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 10:29:21,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:21,019 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 10:29:21,019 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:21,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2132240345, now seen corresponding path program 5 times [2018-11-07 10:29:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:21,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:21,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:22,576 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 10:29:22,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:22,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:22,576 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:22,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:22,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:22,576 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 10:29:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:22,585 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:22,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:29:22,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:22,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:22,850 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 10:29:22,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:22,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:22,858 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 10:29:22,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:22,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:22,884 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 10:29:22,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 10:29:23,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,095 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 10:29:23,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:23,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,107 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 10:29:23,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,135 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 10:29:23,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-07 10:29:23,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:23,279 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 10:29:23,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:29:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,295 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 10:29:23,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:35 [2018-11-07 10:29:23,432 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 10:29:23,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,440 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 10:29:23,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,461 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 10:29:23,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-07 10:29:23,528 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 10:29:23,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:23,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:29:23,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:23,543 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 10:29:23,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-07 10:29:23,598 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 10:29:23,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:34,549 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 10:30:02,295 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 10:30:02,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,300 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 10:30:02,305 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,332 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 10:30:02,586 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 10:30:02,591 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,610 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 10:30:02,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:02,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,619 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,660 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 10:30:02,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:02,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,689 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 10:30:02,691 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:02,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,717 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 10:30:02,718 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:02,720 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:30:02,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:02,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,747 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 10:30:02,748 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:02,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,755 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,757 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,770 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:02,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, 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 10:30:02,778 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:03,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,078 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 10:30:03,079 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:03,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,084 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,088 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,089 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,090 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,090 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,091 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,102 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,111 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 10:30:03,113 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:03,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,261 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,262 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,273 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,287 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 10:30:03,290 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 10:30:03,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,307 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:03,319 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 10:30:03,321 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-11-07 10:30:03,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-07 10:30:03,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 10:30:03,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 10:30:03,549 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 10:30:03,549 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:104, output treesize:50 [2018-11-07 10:30:11,701 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 10:30:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 65 [2018-11-07 10:30:11,723 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:11,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:30:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:30:11,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3663, Unknown=19, NotChecked=0, Total=4160 [2018-11-07 10:30:11,726 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 10:30:15,056 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2018-11-07 10:30:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:15,536 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-11-07 10:30:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 10:30:15,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-11-07 10:30:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:15,541 INFO L225 Difference]: With dead ends: 282 [2018-11-07 10:30:15,541 INFO L226 Difference]: Without dead ends: 280 [2018-11-07 10:30:15,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3304 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=1362, Invalid=8321, Unknown=19, NotChecked=0, Total=9702 [2018-11-07 10:30:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-07 10:30:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 187. [2018-11-07 10:30:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 10:30:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 10:30:15,580 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 62 [2018-11-07 10:30:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:15,581 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 10:30:15,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:30:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 10:30:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:30:15,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:15,582 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 10:30:15,582 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:15,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1372551317, now seen corresponding path program 3 times [2018-11-07 10:30:15,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:15,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:15,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:16,564 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 10:30:16,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:16,565 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:16,565 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:16,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:16,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:16,565 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 10:30:16,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:16,575 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:16,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:16,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:16,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:16,747 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 10:30:16,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:17,065 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 10:30:17,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:17,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 10:30:17,085 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:17,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:30:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:30:17,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:30:17,086 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 10:30:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:17,300 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-11-07 10:30:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:30:17,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-07 10:30:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:17,302 INFO L225 Difference]: With dead ends: 306 [2018-11-07 10:30:17,302 INFO L226 Difference]: Without dead ends: 272 [2018-11-07 10:30:17,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:30:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-07 10:30:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 199. [2018-11-07 10:30:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 10:30:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 218 transitions. [2018-11-07 10:30:17,335 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 218 transitions. Word has length 65 [2018-11-07 10:30:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:17,335 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 218 transitions. [2018-11-07 10:30:17,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:30:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 218 transitions. [2018-11-07 10:30:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 10:30:17,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:17,337 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 10:30:17,337 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:17,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2042156006, now seen corresponding path program 2 times [2018-11-07 10:30:17,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:17,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:17,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:18,443 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 10:30:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:18,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:18,444 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:18,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:18,444 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 10:30:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:18,452 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:18,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:30:18,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:18,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:18,585 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 10:30:18,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,589 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 10:30:18,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,607 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 10:30:18,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-11-07 10:30:18,724 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 10:30:18,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,732 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 10:30:18,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,754 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 10:30:18,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2018-11-07 10:30:18,809 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 10:30:18,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,824 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 10:30:18,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,841 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 10:30:18,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-07 10:30:18,914 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 10:30:18,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:18,923 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 10:30:18,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:18,941 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 10:30:18,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-11-07 10:30:19,007 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 10:30:19,010 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 10:30:19,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:19,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:19,012 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 10:30:19,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:30:19,035 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 10:30:19,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:21,197 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 10:30:40,267 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_48 Int) (v_subst_5 Int) (main_~key~0 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0) (+ |c_main_~#v~0.offset| (* 4 v_main_~i~0_48)) v_subst_5))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))) (< v_main_~i~0_48 1) (< main_~key~0 |c_main_#t~mem3|) (< v_main_~i~0_48 (+ c_main_~j~0 1)))) is different from false [2018-11-07 10:30:40,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-11-07 10:30:40,276 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,278 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 51 treesize of output 58 [2018-11-07 10:30:40,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,351 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,352 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,371 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 10:30:40,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 10:30:40,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,400 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 42 treesize of output 83 [2018-11-07 10:30:40,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 10:30:40,404 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:30:40,405 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:40,406 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,410 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,410 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,430 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 10:30:40,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 10:30:40,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,460 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 83 [2018-11-07 10:30:40,462 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 10:30:40,464 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:30:40,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:40,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:40,484 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 10:30:40,485 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 10:30:40,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-07 10:30:40,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-07 10:30:40,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-07 10:30:40,590 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:65, output treesize:33 [2018-11-07 10:30:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 50 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-07 10:30:40,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:40,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 25] total 53 [2018-11-07 10:30:40,847 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:40,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:30:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:30:40,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2319, Unknown=7, NotChecked=100, Total=2756 [2018-11-07 10:30:40,848 INFO L87 Difference]: Start difference. First operand 199 states and 218 transitions. Second operand 31 states. [2018-11-07 10:30:43,749 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-07 10:30:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:44,134 INFO L93 Difference]: Finished difference Result 373 states and 414 transitions. [2018-11-07 10:30:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:30:44,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-07 10:30:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:44,137 INFO L225 Difference]: With dead ends: 373 [2018-11-07 10:30:44,137 INFO L226 Difference]: Without dead ends: 371 [2018-11-07 10:30:44,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 89 SyntacticMatches, 14 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=1037, Invalid=5280, Unknown=7, NotChecked=156, Total=6480 [2018-11-07 10:30:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-07 10:30:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 218. [2018-11-07 10:30:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 10:30:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-11-07 10:30:44,178 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 64 [2018-11-07 10:30:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:44,179 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-11-07 10:30:44,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:30:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-11-07 10:30:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 10:30:44,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:44,180 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 10:30:44,180 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:44,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1818764072, now seen corresponding path program 3 times [2018-11-07 10:30:44,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:44,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:44,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:45,148 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 10:30:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:45,148 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:45,148 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:45,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:45,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 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 10:30:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:45,158 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:45,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:45,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:45,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:45,560 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 10:30:45,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,564 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 10:30:45,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,583 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 10:30:45,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-11-07 10:30:45,723 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 10:30:45,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,758 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 10:30:45,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,780 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 10:30:45,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2018-11-07 10:30:45,901 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 10:30:45,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:45,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:45,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:45,912 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 10:30:45,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:30:45,925 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 10:30:45,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-11-07 10:30:45,965 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 10:30:45,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:07,152 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 10:31:07,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,156 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 10:31:07,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,224 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,224 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,242 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 10:31:07,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,273 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,291 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 10:31:07,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,325 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 10:31:07,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,330 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,344 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 10:31:07,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,348 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,351 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,352 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,353 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,372 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 10:31:07,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,377 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,401 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 10:31:07,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,416 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,416 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:31:07,436 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 10:31:07,439 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 10:31:07,582 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 10:31:07,583 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:38 [2018-11-07 10:31:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 56 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:31:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2018-11-07 10:31:11,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:11,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:31:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:31:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2285, Unknown=9, NotChecked=0, Total=2550 [2018-11-07 10:31:11,841 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 34 states. [2018-11-07 10:31:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:13,987 INFO L93 Difference]: Finished difference Result 302 states and 332 transitions. [2018-11-07 10:31:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:31:13,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-11-07 10:31:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:13,989 INFO L225 Difference]: With dead ends: 302 [2018-11-07 10:31:13,990 INFO L226 Difference]: Without dead ends: 300 [2018-11-07 10:31:13,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=712, Invalid=4829, Unknown=9, NotChecked=0, Total=5550 [2018-11-07 10:31:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-07 10:31:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 214. [2018-11-07 10:31:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 10:31:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2018-11-07 10:31:14,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 64 [2018-11-07 10:31:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:14,030 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-11-07 10:31:14,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:31:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2018-11-07 10:31:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 10:31:14,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:14,032 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 10:31:14,032 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:14,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1292852080, now seen corresponding path program 4 times [2018-11-07 10:31:14,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:14,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:14,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:14,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:14,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:14,894 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 10:31:14,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:14,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:14,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:14,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:31:14,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:14,894 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 10:31:14,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:14,903 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:31:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:14,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:15,147 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 10:31:15,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:31:15,151 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 10:31:15,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,167 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 10:31:15,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 10:31:15,263 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 10:31:15,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:31:15,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:31:15,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:31:15,274 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 10:31:15,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,292 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 10:31:15,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 10:31:15,564 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 10:31:15,566 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 10:31:15,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:31:15,570 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 10:31:15,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 10:31:15,637 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 10:31:15,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 10:31:21,842 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:31:22,043 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:31:22,043 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:31:22,048 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:31:22,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:31:22 BoogieIcfgContainer [2018-11-07 10:31:22,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:31:22,049 INFO L168 Benchmark]: Toolchain (without parser) took 265423.44 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -296.3 MB). Peak memory consumption was 753.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:22,050 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:22,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.69 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 10:31:22,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.29 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 10:31:22,050 INFO L168 Benchmark]: Boogie Preprocessor took 47.56 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 10:31:22,051 INFO L168 Benchmark]: RCFGBuilder took 647.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:22,051 INFO L168 Benchmark]: TraceAbstraction took 264372.29 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 489.7 MB). Peak memory consumption was 778.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:22,052 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.69 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.29 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 47.56 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 647.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264372.29 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 489.7 MB). Peak memory consumption was 778.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. TIMEOUT Result, 264.3s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 43.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 777 SDtfs, 3600 SDslu, 6477 SDs, 0 SdLazy, 10691 SolverSat, 1235 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 26.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2161 GetRequests, 1186 SyntacticMatches, 109 SemanticMatches, 866 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 19610 ImplicationChecksByTransitivity, 211.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, 0.9s 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.6s SatisfiabilityAnalysisTime, 209.9s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2352 ConstructedInterpolants, 260 QuantifiedInterpolants, 1745914 SizeOfPredicates, 214 NumberOfNonLiveVariables, 1564 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 227/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