java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:01:55,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:01:55,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:01:56,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:01:56,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:01:56,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:01:56,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:01:56,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:01:56,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:01:56,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:01:56,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:01:56,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:01:56,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:01:56,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:01:56,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:01:56,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:01:56,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:01:56,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:01:56,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:01:56,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:01:56,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:01:56,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:01:56,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:01:56,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:01:56,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:01:56,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:01:56,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:01:56,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:01:56,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:01:56,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:01:56,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:01:56,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:01:56,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:01:56,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:01:56,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:01:56,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:01:56,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 04:01:56,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:01:56,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:01:56,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:01:56,094 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:01:56,095 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:01:56,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:01:56,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:01:56,098 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:01:56,098 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 04:01:56,099 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:01:56,099 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:01:56,099 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:01:56,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:01:56,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:01:56,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:01:56,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 04:01:56,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:01:56,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 04:01:56,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 04:01:56,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 04:01:56,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:01:56,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:01:56,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:01:56,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:01:56,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:01:56,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:01:56,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:01:56,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 04:01:56,104 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:01:56,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:01:56,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:01:56,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 04:01:56,105 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 04:01:56,105 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 04:01:56,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:01:56,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:01:56,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:01:56,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:01:56,179 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:01:56,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-27 04:01:56,246 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/55a09556d/92a384301c824a888183ae5ec3336a0c/FLAGbc65fe301 [2018-10-27 04:01:56,669 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:01:56,670 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-27 04:01:56,677 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/55a09556d/92a384301c824a888183ae5ec3336a0c/FLAGbc65fe301 [2018-10-27 04:01:56,693 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/55a09556d/92a384301c824a888183ae5ec3336a0c [2018-10-27 04:01:56,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:01:56,706 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:01:56,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:01:56,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:01:56,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:01:56,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:01:56" (1/1) ... [2018-10-27 04:01:56,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f32220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:56, skipping insertion in model container [2018-10-27 04:01:56,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:01:56" (1/1) ... [2018-10-27 04:01:56,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:01:56,752 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:01:56,951 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:01:56,955 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:01:56,984 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:01:57,011 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:01:57,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57 WrapperNode [2018-10-27 04:01:57,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:01:57,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:01:57,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:01:57,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:01:57,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:01:57,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:01:57,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:01:57,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:01:57,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... [2018-10-27 04:01:57,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:01:57,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:01:57,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:01:57,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:01:57,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:01:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:01:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:01:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:01:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:01:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:01:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:01:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 04:01:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 04:01:57,750 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:01:57,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:01:57 BoogieIcfgContainer [2018-10-27 04:01:57,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:01:57,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:01:57,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:01:57,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:01:57,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:01:56" (1/3) ... [2018-10-27 04:01:57,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3353f888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:01:57, skipping insertion in model container [2018-10-27 04:01:57,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:57" (2/3) ... [2018-10-27 04:01:57,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3353f888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:01:57, skipping insertion in model container [2018-10-27 04:01:57,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:01:57" (3/3) ... [2018-10-27 04:01:57,760 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-10-27 04:01:57,771 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:01:57,780 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 04:01:57,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 04:01:57,836 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:01:57,836 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 04:01:57,836 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:01:57,836 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:01:57,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:01:57,837 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:01:57,837 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:01:57,837 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:01:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-27 04:01:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 04:01:57,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:57,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:01:57,868 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-27 04:01:57,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:57,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:58,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:01:58,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:01:58,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:01:58,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:01:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:01:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:01:58,064 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-27 04:01:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:58,087 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-27 04:01:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:01:58,089 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-27 04:01:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:58,099 INFO L225 Difference]: With dead ends: 51 [2018-10-27 04:01:58,099 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 04:01:58,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:01:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 04:01:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 04:01:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 04:01:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 04:01:58,150 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-27 04:01:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:58,151 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 04:01:58,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:01:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-27 04:01:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:01:58,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:58,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:01:58,153 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:58,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-27 04:01:58,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:58,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:58,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:58,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:58,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:01:58,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:01:58,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:01:58,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:01:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:01:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:01:58,599 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-10-27 04:01:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:58,828 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-27 04:01:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:01:58,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-27 04:01:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:58,830 INFO L225 Difference]: With dead ends: 40 [2018-10-27 04:01:58,830 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 04:01:58,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:01:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 04:01:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-27 04:01:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 04:01:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-27 04:01:58,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-27 04:01:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:58,841 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-27 04:01:58,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:01:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-27 04:01:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:01:58,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:58,842 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:01:58,843 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:58,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-27 04:01:58,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:58,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:58,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:58,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:59,173 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2018-10-27 04:01:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:59,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:59,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:59,260 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 04:01:59,262 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-27 04:01:59,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:01:59,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:01:59,442 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:01:59,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:01:59,526 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 36 variables. [2018-10-27 04:01:59,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:59,540 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:01:59,668 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 86.81% of their original sizes. [2018-10-27 04:01:59,668 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:01:59,711 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-27 04:01:59,712 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:01:59,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:01:59,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-27 04:01:59,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:01:59,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:01:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:01:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:01:59,715 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-10-27 04:02:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:00,017 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-10-27 04:02:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:02:00,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 04:02:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:00,018 INFO L225 Difference]: With dead ends: 48 [2018-10-27 04:02:00,018 INFO L226 Difference]: Without dead ends: 30 [2018-10-27 04:02:00,019 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:02:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-27 04:02:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-27 04:02:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 04:02:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-27 04:02:00,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-27 04:02:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:00,028 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-27 04:02:00,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:02:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-27 04:02:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:02:00,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:00,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:00,030 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:00,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-27 04:02:00,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:00,683 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-27 04:02:00,878 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-10-27 04:02:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:02:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:00,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:00,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 04:02:00,991 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-27 04:02:00,994 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:02:00,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:02:01,003 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:02:04,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:02:04,029 INFO L272 AbstractInterpreter]: Visited 22 different actions 257 times. Merged at 11 different actions 182 times. Widened at 2 different actions 36 times. Found 41 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 04:02:04,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:04,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:02:04,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:04,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:04,085 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:04,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:04,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:04,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 04:02:04,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-10-27 04:02:04,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:02:04,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,565 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:04,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:04,712 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:87, output treesize:35 [2018-10-27 04:02:05,113 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-10-27 04:02:05,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2018-10-27 04:02:05,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:05,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:02:05,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:05,215 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:05,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:02:05,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:05,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:05,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:05,277 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:3 [2018-10-27 04:02:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:02:05,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:06,298 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-10-27 04:02:06,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 04:02:06,439 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-27 04:02:06,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-27 04:02:06,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:06,530 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 39 treesize of output 38 [2018-10-27 04:02:06,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:06,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:06,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-10-27 04:02:06,765 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-27 04:02:06,782 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 36 treesize of output 35 [2018-10-27 04:02:06,783 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:06,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 04:02:06,864 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:06,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:07,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:07,181 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 04:02:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:02:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-27 04:02:07,318 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:07,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:02:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:02:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:02:07,322 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-10-27 04:02:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:08,213 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-27 04:02:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:02:08,214 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-27 04:02:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:08,215 INFO L225 Difference]: With dead ends: 45 [2018-10-27 04:02:08,215 INFO L226 Difference]: Without dead ends: 33 [2018-10-27 04:02:08,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:02:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-27 04:02:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-27 04:02:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 04:02:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-27 04:02:08,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-10-27 04:02:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:08,223 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-27 04:02:08,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:02:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-27 04:02:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 04:02:08,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:08,224 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:08,224 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:08,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1179396881, now seen corresponding path program 2 times [2018-10-27 04:02:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:08,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:08,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:02:08,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:08,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:08,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:08,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:08,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:08,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:08,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:02:08,420 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:02:08,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:02:08,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:08,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:08,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:08,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:08,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 12 [2018-10-27 04:02:08,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:08,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:02:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:02:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:02:08,842 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-10-27 04:02:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:09,263 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-10-27 04:02:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:02:09,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-27 04:02:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:09,268 INFO L225 Difference]: With dead ends: 79 [2018-10-27 04:02:09,268 INFO L226 Difference]: Without dead ends: 58 [2018-10-27 04:02:09,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:02:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-27 04:02:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-10-27 04:02:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 04:02:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-10-27 04:02:09,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-10-27 04:02:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:09,283 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-10-27 04:02:09,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:02:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-10-27 04:02:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 04:02:09,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:09,284 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:09,284 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:09,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 3 times [2018-10-27 04:02:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:09,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:09,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:09,676 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-10-27 04:02:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:09,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:09,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:09,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:09,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:09,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:09,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:02:09,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:02:09,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:02:09,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:09,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:10,033 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:02:10,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:10,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-27 04:02:10,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:10,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:10,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,339 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:10,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,355 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 04:02:10,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 04:02:10,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:10,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:02:10,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:10,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:02:10,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:10,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 04:02:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:02:10,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:11,468 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-10-27 04:02:11,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 04:02:11,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-27 04:02:11,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:11,597 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 39 treesize of output 38 [2018-10-27 04:02:11,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:11,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:11,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-10-27 04:02:11,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 04:02:11,814 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:11,879 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 36 treesize of output 35 [2018-10-27 04:02:11,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:11,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:11,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:11,980 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 04:02:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:12,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:12,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 32 [2018-10-27 04:02:12,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:12,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:02:12,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:02:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:02:12,456 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 21 states. [2018-10-27 04:02:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:14,157 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-10-27 04:02:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:02:14,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-27 04:02:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:14,162 INFO L225 Difference]: With dead ends: 73 [2018-10-27 04:02:14,162 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 04:02:14,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 04:02:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 04:02:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2018-10-27 04:02:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 04:02:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-27 04:02:14,172 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2018-10-27 04:02:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:14,172 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-27 04:02:14,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:02:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-27 04:02:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:02:14,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:14,174 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:14,174 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:14,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2091215382, now seen corresponding path program 4 times [2018-10-27 04:02:14,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:14,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:14,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:14,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:14,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:14,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:14,610 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:14,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:14,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:14,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:14,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:14,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:14,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:14,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:14,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:14,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:14,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 04:02:15,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:15,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:15,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,247 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:15,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,261 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 04:02:15,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 04:02:15,784 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:15,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:02:15,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,817 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:15,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:02:15,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,840 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 04:02:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:15,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:16,333 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-10-27 04:02:16,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 04:02:16,424 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 39 treesize of output 38 [2018-10-27 04:02:16,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:16,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-27 04:02:16,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:16,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:16,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-10-27 04:02:16,664 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 42 treesize of output 41 [2018-10-27 04:02:16,665 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:16,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-10-27 04:02:16,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:16,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:16,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:16,851 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-27 04:02:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:02:17,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:17,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 36 [2018-10-27 04:02:17,325 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:17,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:02:17,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:02:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 04:02:17,327 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 23 states. [2018-10-27 04:02:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:19,465 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-10-27 04:02:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:02:19,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-27 04:02:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:19,467 INFO L225 Difference]: With dead ends: 75 [2018-10-27 04:02:19,467 INFO L226 Difference]: Without dead ends: 63 [2018-10-27 04:02:19,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 04:02:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-27 04:02:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-10-27 04:02:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 04:02:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-27 04:02:19,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-10-27 04:02:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:19,479 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-27 04:02:19,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:02:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-27 04:02:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 04:02:19,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:19,480 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:19,480 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:19,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1817864972, now seen corresponding path program 5 times [2018-10-27 04:02:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:19,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:19,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:19,726 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-27 04:02:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:19,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:19,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:19,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:19,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:19,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:19,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:19,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:02:19,782 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:02:19,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:02:19,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:19,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:19,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-27 04:02:19,950 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:19,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:02:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:02:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:02:19,951 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 8 states. [2018-10-27 04:02:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:20,081 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-10-27 04:02:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:02:20,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-27 04:02:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:20,083 INFO L225 Difference]: With dead ends: 78 [2018-10-27 04:02:20,083 INFO L226 Difference]: Without dead ends: 48 [2018-10-27 04:02:20,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:02:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-27 04:02:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-27 04:02:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 04:02:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-27 04:02:20,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-10-27 04:02:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:20,092 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-27 04:02:20,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:02:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-27 04:02:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 04:02:20,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:20,094 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:20,094 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:20,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash 905430727, now seen corresponding path program 6 times [2018-10-27 04:02:20,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:20,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:20,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:20,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:20,282 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 04:02:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:20,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:20,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:20,388 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:20,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:20,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:20,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:20,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:02:20,396 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:02:20,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:02:20,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:20,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:20,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:20,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:20,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:20,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-27 04:02:20,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:20,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:21,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,025 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:21,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 04:02:21,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 04:02:21,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:21,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:02:21,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:21,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:02:21,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:21,456 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 04:02:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:02:21,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:21,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 04:02:21,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-27 04:02:21,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:22,064 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 39 treesize of output 38 [2018-10-27 04:02:22,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:22,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:22,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-10-27 04:02:22,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-10-27 04:02:22,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:22,321 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 40 treesize of output 39 [2018-10-27 04:02:22,322 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:22,355 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:22,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:22,420 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-27 04:02:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:02:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 18] total 40 [2018-10-27 04:02:23,155 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:23,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 04:02:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 04:02:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 04:02:23,157 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 25 states. [2018-10-27 04:02:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:24,453 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-10-27 04:02:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 04:02:24,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-10-27 04:02:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:24,455 INFO L225 Difference]: With dead ends: 104 [2018-10-27 04:02:24,455 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 04:02:24,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 04:02:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 04:02:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-27 04:02:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 04:02:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-10-27 04:02:24,468 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 42 [2018-10-27 04:02:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:24,468 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-10-27 04:02:24,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 04:02:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-10-27 04:02:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:02:24,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:24,469 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:24,470 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:24,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -907144054, now seen corresponding path program 7 times [2018-10-27 04:02:24,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:24,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:24,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 04:02:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:24,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:24,683 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:24,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:24,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:24,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:24,690 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:24,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:24,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:24,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:24,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:24,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 04:02:25,257 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:25,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:25,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:25,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 04:02:25,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 04:02:25,566 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:25,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 04:02:25,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,575 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:25,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 04:02:25,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:25,591 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 04:02:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 04:02:25,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:26,245 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-27 04:02:26,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-10-27 04:02:26,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-10-27 04:02:26,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,403 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 37 treesize of output 36 [2018-10-27 04:02:26,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:26,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-10-27 04:02:26,609 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-27 04:02:26,613 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 36 treesize of output 35 [2018-10-27 04:02:26,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 04:02:26,651 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,718 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:26,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:26,781 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 04:02:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 04:02:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 20] total 44 [2018-10-27 04:02:28,136 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:28,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:02:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:02:28,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1676, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 04:02:28,138 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 27 states. [2018-10-27 04:02:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:30,333 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-10-27 04:02:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 04:02:30,334 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-10-27 04:02:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:30,337 INFO L225 Difference]: With dead ends: 124 [2018-10-27 04:02:30,337 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 04:02:30,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 04:02:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 04:02:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-10-27 04:02:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 04:02:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-27 04:02:30,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 48 [2018-10-27 04:02:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:30,353 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-27 04:02:30,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:02:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-27 04:02:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:02:30,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:30,354 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:30,354 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:30,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2053536857, now seen corresponding path program 8 times [2018-10-27 04:02:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:30,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:30,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:30,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:30,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:30,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:30,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:30,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:30,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:02:30,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:02:31,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-27 04:02:31,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:31,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:31,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:31,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:31,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:31,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 04:02:31,625 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 04:02:32,082 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 04:02:32,388 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:32,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:32,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:32,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 04:02:32,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 04:02:32,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:32,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:02:32,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,748 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:32,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:02:32,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:32,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 04:02:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:32,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:33,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2018-10-27 04:02:33,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-10-27 04:02:33,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:33,361 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 39 treesize of output 38 [2018-10-27 04:02:33,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:33,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:33,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-10-27 04:02:33,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 04:02:33,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:33,598 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 36 treesize of output 35 [2018-10-27 04:02:33,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:33,627 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:33,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:02:33,685 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 04:02:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:02:34,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:34,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 22] total 50 [2018-10-27 04:02:34,597 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:34,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:02:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:02:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 04:02:34,600 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 31 states. [2018-10-27 04:02:36,414 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-10-27 04:02:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:36,900 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-10-27 04:02:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:02:36,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-10-27 04:02:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:36,902 INFO L225 Difference]: With dead ends: 103 [2018-10-27 04:02:36,902 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 04:02:36,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=652, Invalid=3638, Unknown=0, NotChecked=0, Total=4290 [2018-10-27 04:02:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 04:02:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-10-27 04:02:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 04:02:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-27 04:02:36,915 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-10-27 04:02:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:36,916 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-27 04:02:36,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:02:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-27 04:02:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 04:02:36,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:36,917 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:36,917 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:36,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash 824594169, now seen corresponding path program 1 times [2018-10-27 04:02:36,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:36,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:36,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:36,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:37,288 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:02:37,705 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-27 04:02:38,032 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-27 04:02:39,240 WARN L179 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2018-10-27 04:02:39,525 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-27 04:02:39,662 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-10-27 04:02:39,862 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-10-27 04:02:40,081 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2018-10-27 04:02:40,633 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2018-10-27 04:02:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:41,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:41,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:41,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-27 04:02:41,102 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-27 04:02:41,105 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:02:41,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:02:41,110 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:02:45,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:02:45,835 INFO L272 AbstractInterpreter]: Visited 27 different actions 882 times. Merged at 14 different actions 463 times. Widened at 4 different actions 90 times. Found 45 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-27 04:02:45,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:45,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:02:45,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:45,863 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:02:45,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:45,874 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:45,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:45,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:02:45,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:45,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:45,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 04:02:46,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:46,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:46,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:46,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:02:46,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:02:46,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:46,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:46,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:02:46,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:93, output treesize:85 [2018-10-27 04:02:47,157 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:02:47,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:47,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:02:47,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:02:47,188 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 25 treesize of output 34 [2018-10-27 04:02:47,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:47,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:47,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:47,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:43 [2018-10-27 04:02:50,064 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (main_~max~0 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= .cse0 4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ .cse0 (- 3))) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (<= 4 .cse0)))) is different from true [2018-10-27 04:02:54,158 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 04:02:56,951 WARN L179 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 04:02:57,615 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 04:02:57,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 37 [2018-10-27 04:02:57,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:57,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:02:57,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:57,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:02:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:02:57,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:57,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:57,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:57,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2018-10-27 04:02:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 1 not checked. [2018-10-27 04:02:59,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:03:00,617 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 04:03:00,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-27 04:03:00,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 04:03:00,914 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,915 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:00,919 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 04:03:00,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:00,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:00,927 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 0 case distinctions, treesize of input 35 treesize of output 31 [2018-10-27 04:03:00,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:00,937 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:00,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, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-27 04:03:00,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:00,950 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,950 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:00,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-27 04:03:00,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:00,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,974 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 40 treesize of output 59 [2018-10-27 04:03:00,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:00,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:00,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:00,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-27 04:03:00,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-10-27 04:03:01,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,066 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 0 case distinctions, treesize of input 91 treesize of output 84 [2018-10-27 04:03:01,184 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-10-27 04:03:01,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,196 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 0 case distinctions, treesize of input 35 treesize of output 31 [2018-10-27 04:03:01,197 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,200 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 0 case distinctions, treesize of input 43 treesize of output 46 [2018-10-27 04:03:01,201 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-10-27 04:03:01,206 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,212 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,212 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2018-10-27 04:03:01,222 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,226 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-10-27 04:03:01,230 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,233 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,239 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 0 case distinctions, treesize of input 53 treesize of output 63 [2018-10-27 04:03:01,240 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,290 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,332 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-27 04:03:01,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-10-27 04:03:01,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-10-27 04:03:01,363 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,367 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-10-27 04:03:01,369 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,384 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 04:03:01,413 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,428 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-27 04:03:01,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 04:03:01,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-27 04:03:01,636 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,652 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,661 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 40 treesize of output 59 [2018-10-27 04:03:01,662 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,667 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,667 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-27 04:03:01,673 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,688 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,692 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 04:03:01,693 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,699 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 0 case distinctions, treesize of input 35 treesize of output 31 [2018-10-27 04:03:01,700 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,743 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:03:01,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-27 04:03:01,782 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,828 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,858 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-27 04:03:01,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:01,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-10-27 04:03:01,871 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:03:01,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:03:01,924 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:03:01,925 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:03:01,927 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:01,946 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:01,980 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:03:02,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-27 04:03:02,109 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:147, output treesize:192 [2018-10-27 04:03:02,366 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-27 04:03:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:03:03,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:03:03,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 22] total 63 [2018-10-27 04:03:03,159 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:03:03,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-27 04:03:03,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 04:03:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3340, Unknown=4, NotChecked=120, Total=3906 [2018-10-27 04:03:03,162 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2018-10-27 04:03:05,513 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 29 [2018-10-27 04:03:10,160 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 04:03:10,389 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 32 [2018-10-27 04:03:11,108 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 43 [2018-10-27 04:03:37,765 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2018-10-27 04:03:49,364 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2018-10-27 04:03:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:03:49,773 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-10-27 04:03:49,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 04:03:49,773 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2018-10-27 04:03:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:03:49,775 INFO L225 Difference]: With dead ends: 89 [2018-10-27 04:03:49,775 INFO L226 Difference]: Without dead ends: 87 [2018-10-27 04:03:49,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=1057, Invalid=6771, Unknown=8, NotChecked=174, Total=8010 [2018-10-27 04:03:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-27 04:03:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-10-27 04:03:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 04:03:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-27 04:03:49,792 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 57 [2018-10-27 04:03:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:03:49,793 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-27 04:03:49,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-27 04:03:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-27 04:03:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-27 04:03:49,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:03:49,794 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:03:49,794 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:03:49,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:03:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash -925373209, now seen corresponding path program 2 times [2018-10-27 04:03:49,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:03:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:49,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:03:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:03:49,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:03:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:03:50,174 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:03:50,335 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-27 04:03:50,932 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2018-10-27 04:03:51,594 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-10-27 04:03:51,784 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-27 04:03:51,942 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2018-10-27 04:03:52,088 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2018-10-27 04:03:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:03:52,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:52,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:52,812 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:03:52,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:03:52,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:52,813 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:03:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:03:52,821 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:03:53,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 04:03:53,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:03:53,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:53,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:03:53,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-10-27 04:03:53,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-10-27 04:03:53,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:03:53,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-10-27 04:03:53,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:03:53,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:53,819 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 25 treesize of output 34 [2018-10-27 04:03:53,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:53,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-27 04:03:54,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:03:54,024 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:03:54,026 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 25 treesize of output 34 [2018-10-27 04:03:54,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:54,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:54,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:54,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-10-27 04:03:58,860 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|))))) is different from true [2018-10-27 04:04:01,268 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_4| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_4|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_4|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_4| |v_main_~#str1~0.base_BEFORE_CALL_4|))))) is different from true [2018-10-27 04:04:05,379 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 04:04:09,685 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 04:04:10,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 30 [2018-10-27 04:04:10,050 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:10,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:04:10,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:10,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:10,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:04:10,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:10,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:10,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:10,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:3 [2018-10-27 04:04:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2018-10-27 04:04:12,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:13,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-27 04:04:13,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:13,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-10-27 04:04:13,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:04:13,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-10-27 04:04:13,906 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:13,908 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 33 treesize of output 44 [2018-10-27 04:04:13,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:13,943 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 30 treesize of output 42 [2018-10-27 04:04:13,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:13,970 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:13,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-10-27 04:04:13,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:14,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:14,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:04:14,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:04:14,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 117 [2018-10-27 04:04:14,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 97 [2018-10-27 04:04:14,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,114 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 81 treesize of output 80 [2018-10-27 04:04:14,223 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-10-27 04:04:14,227 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,261 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 3 case distinctions, treesize of input 68 treesize of output 111 [2018-10-27 04:04:14,264 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:14,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,279 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,302 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 3 case distinctions, treesize of input 78 treesize of output 108 [2018-10-27 04:04:14,305 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:14,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,337 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 3 case distinctions, treesize of input 75 treesize of output 109 [2018-10-27 04:04:14,339 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:14,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,375 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 3 case distinctions, treesize of input 66 treesize of output 105 [2018-10-27 04:04:14,379 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 6 xjuncts. [2018-10-27 04:04:14,396 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,413 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 44 treesize of output 56 [2018-10-27 04:04:14,415 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:14,417 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,419 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,421 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,428 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 71 [2018-10-27 04:04:14,429 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:14,598 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:04:14,710 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:04:14,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:14,891 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 0 case distinctions, treesize of input 109 treesize of output 102 [2018-10-27 04:04:14,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:14,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 90 [2018-10-27 04:04:15,139 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-27 04:04:15,151 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,157 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 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-27 04:04:15,158 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,167 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 0 case distinctions, treesize of input 72 treesize of output 70 [2018-10-27 04:04:15,168 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,190 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-10-27 04:04:15,194 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,202 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-10-27 04:04:15,202 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,204 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:15,205 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,211 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 82 treesize of output 72 [2018-10-27 04:04:15,212 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:15,352 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,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, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 85 [2018-10-27 04:04:15,374 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:15,380 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,394 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 04:04:15,395 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:15,419 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,433 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,446 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 56 treesize of output 82 [2018-10-27 04:04:15,447 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:15,530 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:15,595 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:15,796 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:15,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-27 04:04:15,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-27 04:04:15,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:15,827 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-27 04:04:15,997 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-27 04:04:16,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,004 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 0 case distinctions, treesize of input 49 treesize of output 49 [2018-10-27 04:04:16,004 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-10-27 04:04:16,007 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-27 04:04:16,011 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-27 04:04:16,017 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,018 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:04:16,018 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-10-27 04:04:16,023 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:16,132 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,138 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-27 04:04:16,163 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:16,166 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,167 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,167 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,193 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 49 treesize of output 93 [2018-10-27 04:04:16,195 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:16,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,215 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 04:04:16,216 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:16,324 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:04:16,383 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:04:16,454 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:04:16,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-27 04:04:16,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-27 04:04:16,666 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,683 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-27 04:04:16,851 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-27 04:04:16,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,873 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 04:04:16,874 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:16,878 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,881 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,886 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 90 [2018-10-27 04:04:16,913 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:16,917 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,919 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 91 [2018-10-27 04:04:16,950 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:16,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:16,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:16,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 87 [2018-10-27 04:04:17,092 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:17,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,098 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:17,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-27 04:04:17,128 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-10-27 04:04:17,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,157 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 49 treesize of output 93 [2018-10-27 04:04:17,159 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 4 xjuncts. [2018-10-27 04:04:17,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:04:17,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 0 case distinctions, treesize of input 44 treesize of output 44 [2018-10-27 04:04:17,319 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:17,375 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:17,422 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:17,483 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:17,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-27 04:04:17,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-10-27 04:04:17,494 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,496 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 41 treesize of output 52 [2018-10-27 04:04:17,525 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-10-27 04:04:17,527 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:17,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,534 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:04:17,543 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 53 [2018-10-27 04:04:17,543 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-10-27 04:04:17,572 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:04:17,607 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:04:17,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-27 04:04:17,655 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:17,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-10-27 04:04:17,657 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:04:17,682 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:04:17,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-10-27 04:04:17,915 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 6 variables, input treesize:171, output treesize:457 [2018-10-27 04:04:18,370 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-27 04:04:18,853 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-10-27 04:04:19,143 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 04:04:19,413 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 04:04:19,687 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 04:04:20,029 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-10-27 04:04:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 04:04:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:04:20,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 23] total 68 [2018-10-27 04:04:20,103 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:04:20,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-27 04:04:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 04:04:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=3908, Unknown=6, NotChecked=258, Total=4556 [2018-10-27 04:04:20,106 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 50 states. [2018-10-27 04:04:21,455 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-10-27 04:04:21,829 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-10-27 04:04:29,692 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-27 04:04:31,164 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-10-27 04:04:31,868 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2018-10-27 04:04:38,007 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 04:04:42,137 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-10-27 04:04:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:58,879 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-27 04:04:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 04:04:58,880 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-10-27 04:04:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:58,882 INFO L225 Difference]: With dead ends: 93 [2018-10-27 04:04:58,882 INFO L226 Difference]: Without dead ends: 91 [2018-10-27 04:04:58,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 89 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=936, Invalid=7806, Unknown=8, NotChecked=370, Total=9120 [2018-10-27 04:04:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-27 04:04:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-10-27 04:04:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:04:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-27 04:04:58,900 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 66 [2018-10-27 04:04:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:58,900 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-27 04:04:58,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-27 04:04:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-27 04:04:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 04:04:58,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:58,902 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:04:58,902 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:58,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1861098169, now seen corresponding path program 3 times [2018-10-27 04:04:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:58,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:04:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:58,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:59,575 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-27 04:04:59,729 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2018-10-27 04:04:59,887 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2018-10-27 04:05:00,108 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-10-27 04:05:00,333 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-27 04:05:00,525 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-27 04:05:00,692 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-10-27 04:05:00,865 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2018-10-27 04:05:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:05:01,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:05:01,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:05:01,944 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:05:01,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:05:01,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:05:01,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:05:01,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:05:01,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:05:02,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:05:02,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:05:02,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:05:02,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:05:02,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-27 04:05:02,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-10-27 04:05:02,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:05:02,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-10-27 04:05:02,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:05:02,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:05:02,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2018-10-27 04:05:02,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-10-27 04:05:02,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:05:02,962 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 30 [2018-10-27 04:05:02,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:02,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-10-27 04:05:03,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:05:03,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2018-10-27 04:05:03,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:05:03,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:133, output treesize:97 [2018-10-27 04:05:03,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-10-27 04:05:03,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:05:03,395 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 25 treesize of output 34 [2018-10-27 04:05:03,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-10-27 04:05:03,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:05:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-10-27 04:05:03,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:05:03,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:93 [2018-10-27 04:05:03,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-10-27 04:05:03,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:05:03,804 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 30 [2018-10-27 04:05:03,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,850 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:05:03,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:03,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:46 [2018-10-27 04:06:06,605 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 04:06:09,043 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_8| Int) (main_~max~0 Int) (|v_main_~#str2~0.base_BEFORE_CALL_8| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_8|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_8|) (+ .cse0 (- 1)))) (<= .cse0 2147483647) (< .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_8| |v_main_~#str1~0.base_BEFORE_CALL_8|)) (<= 4 .cse0)))) is different from true [2018-10-27 04:06:09,423 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:06:11,540 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (main_~max~0 Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) (+ .cse0 (- 1)))) (<= .cse0 2147483647) (< .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (<= 4 .cse0)))) is different from true [2018-10-27 04:06:11,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 34 [2018-10-27 04:06:11,988 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:06:11,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 04:06:11,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:06:11,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:06:12,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:06:12,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:06:12,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:06:12,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:06:12,015 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:3 [2018-10-27 04:06:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 7 trivial. 16 not checked. [2018-10-27 04:06:13,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-10-27 04:06:20,582 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 04:06:20,783 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:06:20,783 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 04:06:20,788 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 04:06:20,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:06:20 BoogieIcfgContainer [2018-10-27 04:06:20,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:06:20,789 INFO L168 Benchmark]: Toolchain (without parser) took 264084.09 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-27 04:06:20,790 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:06:20,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 04:06:20,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:06:20,790 INFO L168 Benchmark]: Boogie Preprocessor took 29.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:06:20,790 INFO L168 Benchmark]: RCFGBuilder took 650.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-10-27 04:06:20,791 INFO L168 Benchmark]: TraceAbstraction took 263036.79 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 854.1 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 176.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-27 04:06:20,793 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.22 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 304.92 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 57.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.62 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 650.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263036.79 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 854.1 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 176.9 MB). Peak memory consumption was 1.0 GB. 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 76 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 262.9s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 97.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 374 SDtfs, 619 SDslu, 3853 SDs, 0 SdLazy, 6345 SolverSat, 531 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1120 GetRequests, 611 SyntacticMatches, 23 SemanticMatches, 486 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7087 ImplicationChecksByTransitivity, 108.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.1s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9733333333333333 AbsIntWeakeningRatio, 2.15 AbsIntAvgWeakeningVarsNumRemoved, 20.85 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 140 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 73.4s InterpolantComputationTime, 907 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1300 ConstructedInterpolants, 56 QuantifiedInterpolants, 1611151 SizeOfPredicates, 259 NumberOfNonLiveVariables, 2457 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 701/1664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown